题目描述:给定一个字符串数组,将字母异位词组合在一起。字母异位词指字母相同,但排列不同的字符串。
示例:
输入: ["eat", "tea", "tan", "ate", "nat", "bat"]
输出:
[
["ate","eat","tea"],
["nat","tan"],
["bat"]
]
方法一:
class Solution {
public:
vector<vector<string>> groupAnagrams(vector<string>& strs) {
vector<vector<string>> res;
//复制strs,保存排序好的字符串
vector<string> tmp=strs;
for(int i=0;i<tmp.size();i++){
sort(tmp[i].begin(),tmp[i].end());
}
//判断字符串是否已经被访问
vector<int>vis=vector(tmp.size(),0);
//遍历找到字母异位词
for(int i=0;i<tmp.size();i++){
vector<string>cur;
if(vis[i]==1) continue;
vis[i]=1;
cur.push_back(strs[i]);
for(int j=i+1;j<tmp.size();j++){
if(tmp[i]==tmp[j]){
cur.push_back(strs[j]);
vis[j]=1;
}
}
res.push_back(cur);
}
return res;
}
};
方法二:
class Solution {
public:
vector<vector<string>> groupAnagrams(vector<string>& strs) {
vector<vector<string>> res;
//key:字符->个数 value:字符串
map<map<char,int>,vector<string>>hash;
for(int i=0;i<strs.size();i++){
//hash的key
map<char,int>tmp;
for(int j=0;j<strs[i].length();j++){
tmp[strs[i][j]]++;
}
//hash的value
hash[tmp].push_back(strs[i]);
}
//取出答案
for(map<map<char,int>,vector<string>>::iterator it=hash.begin();it!=hash.end();it++){
res.push_back(it->second);
}
return res;
}
};