Leetcode每日一题随缘更新
题目地址:https://leetcode-cn.com/problems/group-anagrams-lcci/
class Solution {
public:
vector<vector<string>> groupAnagrams(vector<string>& strs) {
char alphabeta[26];
vector<vector<string>> ans;
int cur_pos = 1;
unordered_map<string, int> is_exist;
for(string & str : strs){
memset(alphabeta, 'a', 26);
for(char & ch : str)
alphabeta[ch - 'a']++;
string _26str = "";
for(int i = 0; i < 26; ++i)
_26str += alphabeta[i];
if(0 != is_exist[_26str])
ans[is_exist[_26str] - 1].emplace_back(str);
else{
is_exist[_26str] = cur_pos;
cur_pos++;
vector<string> temp;
temp.emplace_back(str);
ans.emplace_back(temp);
}
}
return ans;
}
};