解题思路:
(1)排序+map
class Solution {
public:
vector<vector<string>> groupAnagrams(vector<string>& strs) {
unordered_map<string,vector<string>> v;
vector<vector<string>> vec;
for(int i=0;i<strs.size();i++) {
string str=strs[i];
sort(strs[i].begin(),strs[i].end());
v[strs[i]].push_back(str);
}
for(auto it=v.begin();it!=v.end();it++) {
vector<string> v1;
for(auto &w:it->second) {
v1.push_back(w);
}
vec.push_back(v1);
}
return vec;
}
};