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.
class Solution {
public:
string enCode(string &s)
{
string tmp = s;
sort(tmp.begin(), tmp.end());
return tmp;
}
vector<vector<string>> groupAnagrams(vector<string>& strs)
{
vector<vector<string>> ans;
map<string, vector<string>> m;
for(int i=0; i<strs.size(); i++)
{
m[enCode(strs[i])].push_back(strs[i]);
}
map<string, vector<string>>::iterator it;
for(it = m.begin(); it != m.end(); it++)
{
ans.push_back(it->second);
}
return ans;
}
};