<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) {
         unordered_map<char,int> mp;
         for(int i = 0; i < words[0].size(); i++)
         {
            mp[words[0][i]] += 1;
         }
         for(int i = 1; i < words.size(); i++)
         {
            string tmp = words[i];
            for(auto it = mp.begin(); it != mp.end(); it++)
            {
                char target = it->first;
                int count_tmp = count(words[i].begin(), words[i].end(), target);
                if(count_tmp == 0)
                it->second = 0;
                else 
                {
                    if(count_tmp < (it -> second))
                    it->second = count_tmp;
                }
            }
         }
         vector<string> re;
         for(auto it = mp.begin(); it != mp.end(); it++)
            {
                while(it->second > 0)
                {
                    string tmp;
                    tmp.push_back(it->first);
                    re.push_back(tmp);
                    mp[it->first] -= 1;
                }
            }
        return re;
    }
};
12200