Given an array of strings, return all groups of strings that are anagrams. Note: All inputs will be in lower-case.
思路:用一个map<string, int>保存字符串,如果字符串第一次遇到,那么把这个字符串放入map,如果第2、3、4、...次遇到,那么把第1、2、3、4、...次的字符串放入返回的向量中。
class Solution {
public:
vector<string> anagrams(vector<string> &strs) {
vector<string> res;
if (strs.size() <= 1) return res;
map<string, int> anagram;
for (int i = 0; i < strs.size(); ++i)
{
string s = strs[i];
sort(s.begin(), s.end());
if (anagram.find(s) == anagram.end()) {
anagram.insert(std::pair<string,int>(s, i));
} else {
if (anagram[s] >= 0) {
res.push_back(strs[anagram[s]]);
anagram[s] = -1;
}
res.push_back(strs[i]);
}
}
return res;
}
};