49. 字母异位词分组

class Solution {
public:
    vector<vector<string>> groupAnagrams(vector<string>& strs) {
        int cout=0;
        vector<vector<string>>re;
        unordered_map<string,int>hash;
        for(auto c:strs)
        {
            string str=c;
            sort(str.begin(),str.end());//排个序使得异位词情况一致
            if (hash.find(str)==hash.end())
            {
                hash[str]=cout;
                cout++;
                re.push_back(vector<string>{});//添加空行
            }
            re[hash[str]].push_back(c);
        }
        return re;
    }
};