Given an array 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
题意:给出一个仅包含小写字母的字符串集合,求出出现在所有子串中的公共字母的集合(若一个字母在所有子串中都出现了x次,则结果中应有x次)。
思路:因为最多有100个字符串,且仅包含小写字母,可以开辟一个二维数组cnt,cnt[i][j]表示第j个子串中字母i+'a'出现的次数。将所有子串都遍历完后,对每个字母所表示的一维数组cnt[i]进行排序,取最少一个即为最终结果集合中该字母的次数。
class Solution {
public:
int cnt[26][110];
vector<string>vec;
vector<string> commonChars(vector<string>& A) {
for(int i=0;i<26;i++)
memset(cnt[i],0,sizeof(cnt[i]));
for(int i=0;i<A.size();i++){
for(int j=0;j<A[i].length();j++){
cnt[A[i][j]-'a'][i]++;
}
}
for(int i=0;i<26;i++){
char h=i+'a';
string s;
s+=h;
sort(cnt[i],cnt[i]+A.size());
for(int j=0;j<cnt[i][0];j++)
vec.push_back(s);
}
return vec;
}
};