19
08/2015
[LeetCode] Group Anagrams
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:
For the return value, each inner list's elements must follow the lexicographic order.
All inputs will be in lower-case.
解题思路：
用hash的方法，将所有的字符分组。
class Solution {
public:
vector<vector<string>> groupAnagrams(vector<string>& strs) {
vector<vector<string>> result;
std::sort(strs.begin(), strs.end());
map<string, vector<string>> codeToStrs;
for(int i = 0; i<strs.size(); i++){
codeToStrs[getCode(strs[i])].push_back(strs[i]);
}
for(map<string, vector<string>>::iterator it = codeToStrs.begin(); it!= codeToStrs.end(); it++){
result.push_back(it->second);
}
return result;
}
string getCode(string s){
std::sort(s.begin(), s.end());
return s;
}
};转载请注明：康瑞部落 » [LeetCode] Group Anagrams
0 条评论