leetcode1002.查找共用字符（简单）

计数：hash
是用一个数组：sums[n][26]来记录每个字符串中字符的个数，然后获得每个字符出现个数的最小值，转化成字符串，放到ans中。

class Solution {
public:
    vector<string> commonChars(vector<string>& words) {

        int n = words.size();
        vector<vector<int>> sums(n, vector<int>(26));
        for (int i = 0; i < n; ++i) {
            int len = words[i].size();
            for (int j = 0; j < len; ++j) {
                sums[i][words[i][j] - 'a']++;
            }
        }
        vector<string> ans;
        for (int j = 0; j < 26; ++j) {
            int Min = sums[0][j];
            for (int i = 1; i < n; ++i) {
                Min = min(Min, sums[i][j]);
            }
            for (int k = 0; k < Min; ++k) {
                ans.push_back(string(1, 'a' + j));
            }
        }
        return ans;
    }

};