题目链接:Group Anagrams
- 题目描述:
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.
(1)思路:建立map<排序后字符串,vector<同一组anagram>>排序,对每个字符串都进行排序,排序之后结果相同的属于一组anagram。
(2)代码:
class Solution {
public:
vector<vector<string>> groupAnagrams(vector<string>& strs) {
map<string, vector<string>> sorted;
for (int i = 0; i < strs.size(); i++) {
string temp = strs[i];
sort(temp.begin(), temp.end());
if (sorted.count(temp) == 1) sorted[temp].push_back(strs[i]);
else {
vector<string> entry;
entry.push_back(strs[i]);
sorted.insert(pair<string, vector<string>>(temp, entry));
}
}
vector<vector<string>> ans;
for (map<string, vector<string>>::iterator i = sorted.begin(); i != sorted.end(); i++) {
ans.push_back(i->second);
}
return ans;
}
};