1002. Find Common Characters(STL应用)

Given anarray A of strings made only from lowercase letters, return a list of all characters that show up in all strings within the list (including duplicates). For example, if a character occurs 3 times in all strings but not 4 times, you need to include that character three times in the final answer.

You may return the answer in any order.

Example 1:

Input: ["bella","label","roller"]
Output: ["e","l","l"]

Example 2:

Input: ["cool","lock","cook"]
Output: ["c","o"]

Note:

1 <= A.length <= 100
1 <= A[i].length <= 100
A[i][j] is a lowercase letter

题目难度：easy
解题思路：先统计每个字符串的字符个数，然后用map存放，最后对26个小写字母进行遍历统计.
解题代码：

class Solution {
public:
  vector<string> commonChars(vector<string>& A) {
  vector<string> ret;
    vector<map<char,int> > tmp(A.size());
    for(int i=0;i<A.size();i++){
      for(int j=0;j<A[i].size();j++){
        tmp[i][A[i][j]]++;
      }
    }
    for(int i=0;i<26;i++){
      int mincnt=101;
      for(int j=0;j<A.size();j++){
        if(tmp[j]['a'+i]<mincnt) mincnt=tmp[j]['a'+i];
      }
      while(mincnt--){
        string s;
        s.push_back('a'+i);
        ret.push_back(s);
      }
    }
    return ret;
  }
};