使用手写的hash，把每个字母的ascii码加起来再模，来定位hash表的索引。

不懂可以在评论区问我，正常题解可以参照leetcode官方题解

class Hash{
public:static const int MAXN = 10007;int size;vector<list<pair<string, int>>> table;Hash(): size(0), table(MAXN) {}bool check(string str1, string str2)  //检查是否为字母异位词{if(str1.length()!=str2.length()) {return false;}int count1[26] = {0}; int count2[26] = {0};for(int i = 0; i<str1.size(); i++){count1[str1[i]-'a']++;}for(int i = 0; i<str2.size(); i++){count2[str2[i]-'a']++;}for(int i = 0; i<26; i++){if(count1[i]!=count2[i]){return false;}}return true;}int f(std::string str){int sum = 0;for(auto ch: str){sum += ch-'a';}return sum%MAXN;}int& operator[](string key){int index = f(key);auto& bucket = table[index];for(auto& p: bucket){if(check(p.first, key)){return p.second;}}bucket.emplace_back(key, size);size++;return (--bucket.end())->second;}int find(string key){int index = f(key);auto& bucket = table[index];for(auto& p: bucket){if(check(p.first, key)){return p.second;}}return -1;}
};class Solution {
public:vector<vector<string>> groupAnagrams(vector<string>& strs) {Hash hash;vector<vector<string>> ans;for(auto& str: strs){if(hash.find(str)==-1){hash[str];ans.push_back(vector<string>{str});}else{ans[hash[str]].push_back(str);}}return ans;}
};