<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) {
        map<char, int> mapper;
        vector<string> res;
        for (int i = 0; i < words[0].length(); i++) {
            mapper[words[0][i]]++;
        }
        for (string s : words) {
            map<char,int> curr;
            for (char c : s) {
                if (mapper.find(c) != mapper.end() && mapper[c] > 0) {
                    curr[c]++;
                    mapper[c]--;
                }
            }
            mapper = curr;
        }
        for (auto i : mapper) {
            string s = "";
            while(i.second-- > 0) {
                res.push_back(s + i.first);
            }
        }
        return res;
    }
};
15000