<p>Given a string array <code>words</code>, return <em>an array of all characters that show up in all strings within the </em><code>words</code><em> (including duplicates)</em>. You may return the answer in <strong>any order</strong>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> words = ["bella","label","roller"]
<strong>Output:</strong> ["e","l","l"]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> words = ["cool","lock","cook"]
<strong>Output:</strong> ["c","o"]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= words.length &lt;= 100</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 100</code></li>
	<li><code>words[i]</code> consists of lowercase English letters.</li>
</ul>

class Solution {
public:
    vector<string> commonChars(vector<string>& words) {
        if (words.empty()) {
        return {};
    }

    map<char, int> commonCount;
    for (char c : words[0]) {
        commonCount[c]++;
    }

    for (int i = 1; i < words.size(); i++) {
        map<char, int> tempCount;
        for (char c : words[i]) {
            tempCount[c]++;
        }

        for (auto& pair : commonCount) {
            char c = pair.first;
            int count = min(pair.second, tempCount[c]);
            commonCount[c] = count;
        }
    }

    vector<string> result;
    for (auto& pair : commonCount) {
        char c = pair.first;
        int count = pair.second;
        for (int i = 0; i < count; i++) {
            result.push_back(string(1, c));
        }
    }
    return result;
    }
};
15800