题目
Given an array of strings, group anagrams together.
For example, given: [“eat”, “tea”, “tan”, “ate”, “nat”, “bat”],
Return:
[
[“ate”, “eat”,”tea”],
[“nat”,”tan”],
[“bat”]
]
Note: All inputs will be in lower-case.
思路
哈希映射,将每一个单词排序,然后放到排序后的字符串对应的向量中,c++map即可实现。
代码
class Solution {
public:
vector<vector<string> > groupAnagrams(vector<string>& strs) {
vector<vector<string> > res;
map<string, vector<string> > mm;
for(int i=0; i<strs.size(); i++){
string str = strs[i];
sort(str.begin(), str.end());
mm[str].push_back(strs[i]);
}
for(map<string, vector<string> >::iterator it=mm.begin(); it!=mm.end(); it++)
res.push_back(it->second);
return res;
}
};