<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> m;
        for (char c : words[0]) m[c]++;
        for (string s : words) {
            map<char,int> n;
            for (char c : s) n[c]++;
            for (auto i = m.begin();i != m.end();i++)
                if (n[i->first] != i->second) i->second = min(n[i->first], i->second);
        }
        vector<string> ans;
        for (auto i = m.begin();i != m.end();i++) 
                while(i->second--) ans.push_back(string {i->first});
        return ans;
    }
};
16100