<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) {
        sort(begin(words),end(words),[]<typename T>(const T& x,const T& y){
            return std::size(x)<std::size(y);
        });
        const auto n{int(size(words))};
        static constexpr const std::size_t theChars{26};
        int h[theChars] = {0};
        const auto& theFirst{words.front()};
        for(auto&& x: theFirst){
            ++h[x-'a'];
        }
        const auto l{int(size(theFirst))};
        for(int i{1};i<n;++i){
            const auto& nextOne{words[i]};
            int temp[theChars] = {0};
            for(int j{};j<l;++j){
                ++temp[nextOne[j]-'a'];
            }
            for(int k{};k<theChars;++k){
                h[k]=min(h[k],temp[k]);
            }
        }
        vector<string> theRes{};
        for(int i{};i<theChars;++i){
            while(h[i]--){
                theRes.emplace_back(string(1,i+'a'));
            }
        }
        return theRes;
    }
};
11800