给定一个字符串数组,将字母异位词组合在一起。字母异位词指字母相同,但排列不同的字符串。
示例:
输入: ["eat", "tea", "tan", "ate", "nat", "bat"],
输出:
[
["ate","eat","tea"],
["nat","tan"],
["bat"]
]
说明:
所有输入均为小写字母。
不考虑答案输出的顺序。
法一:效率太低
class Solution {
public:
vector<vector<string>> groupAnagrams(vector<string>& strs) {
vector<bool> is_get(strs.size(), 0);
vector<unordered_map<char,int>> m;
for (auto str : strs) {
unordered_map<char,int> temp;
for (auto i : str) {
temp[i]++;
}
m.push_back(temp);
}
vector<vector<string>> ret;
for(int i = 0; i < strs.size(); i++) {
if ( is_get[i] == 1)
continue;
vector<string> t;
t.push_back(strs[i]);
for (int j = i+1; j < strs.size(); j++) {
if( strs[i].length() != strs[j].length() )
continue;
int k = 0;
for (k = 0; k < strs[i].length(); k++) {
if( m[i][strs[i][k]] != m[j][strs[i][k]] )
break;
}
if ( k == strs[i].size() ) {
is_get[j] = 1;
t.push_back(strs[j]);
}
}
ret.push_back(t);
}
return ret;
}
};
法二:效率比较高
class Solution {
public:
vector<vector<string>> groupAnagrams(vector<string>& strs) {
vector<vector<string>> ret;
unordered_map<string, vector<string>> m;
for (string &s : strs) {
string temp = s;
sort(temp.begin(), temp.end());
m[temp].push_back(s);
}
for (pair ve : m) {
ret.push_back(ve.second);
}
return ret;
}
};
static const auto __ = []() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
return nullptr;
}();