排序后相同的字符串就是一组
vector<vector<string>> groupAnagrams(vector<string>& strs) {
map<string,vector<string>> hash;
for(int i=0;i<strs.size();++i){
string key = strs[i];
sort(key.begin(),key.end());
if(hash.find(key) == hash.end())
hash[key] = {strs[i]};
else
hash[key].push_back(strs[i]);
}
vector<vector<string>> res;
for(auto it = hash.begin();it!=hash.end();++it){
res.push_back(it->second);
}
return res;
}