题目链接:https://leetcode.com/problems/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.
分析:Anagram(回文构词法)是指打乱字母顺序从而得到新的单词,比如“dormitory”打乱字母吮吸会变成"dirty room","tea"会变成"eat"。
回文构词法有一个特点:单词里的字母的种类和数目没有改变,只是改变了字母的排列顺序。因此,将几个单词按照字母顺序排列后,若它们相等,则它们属于同一组anagrams。
代码:
class Solution {
public:
vector<vector<string>> groupAnagrams(vector<string>& strs) {
unordered_map<string,vector<string>> group;
for(const auto &s:strs){
string key = s;
sort(key.begin(),key.end());
group[key].push_back(s);
}
vector<vector<string>> res;
for(auto it = group.cbegin();it!=group.cend();it++){
vector<string> tmp;
tmp.insert(tmp.end(),it->second.begin(),it->second.end());
res.push_back(tmp);
}
return res;
}
};