Discription:
Given an array of strings, group anagrams together.
For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"]
,
Return:
[ ["ate", "eat","tea"], ["nat","tan"], ["bat"] ]
Solution:
vector<vector<string>> groupAnagrams(vector<string>& strs) {
vector<vector<string>> result;
if (strs.empty())
return result;
unordered_map<string, vector<string>> map;
map.clear();
for (string str : strs){
string sortstr(str);
sort(sortstr.begin(), sortstr.end());
map[sortstr].push_back(str);
}
for (auto temp : map){
result.push_back(temp.second);
}
return result;
}
GitHub-Leetcode:
https://github.com/wenwu313/LeetCode