leetcode49.异位词分组

想偷懒利用上次242有效的字母异位词的函数

class Solution {
public:
	bool isAnagram(string s, string t) {
		int ls = s.length(), i, j;
		int lt = t.length();
		if (ls != lt)return false;
		vector<int>record(27, 0);
		for (i = 0; i < ls; i++)
		{
			record[s[i] - 'a']++;
		}
		for (i = 0; i < lt; i++)
		{
			record[t[i] - 'a']--;
		}
		for (auto &i : record)
			if (i != 0)
				return false;
		return true;

	}

	vector<vector<string>> groupAnagrams(vector<string>& strs) {
		int ptr = 0;
		int lstrs = strs.size(), i, j = 0;
		vector<vector<string>>res;
		for (i = 0; i < lstrs; i++)
		{
			for (j = 0; j < ptr; j++)
			{
				if (isAnagram(res[j][0], strs[i]))
				{
					res[j].push_back(strs[i]);
					break;
				}
			}
			if (j == ptr)
			{
				vector<string>temp;
				res.push_back(temp);
				res[j].push_back(strs[i]);
				ptr += 1;
			}
		}
		return res;
	}
};

虽然调试可以成功，但是超出时间限制
然后还是老实地用评论区sort+map的方法…

class Solution {
public:
    vector<vector<string>> groupAnagrams(vector<string>& strs) {
        int lstrs=strs.size(),i,j;
        vector<vector<string>>res;
        unordered_map<string,vector<string>>mymap;
        string key;
        for(i=0;i<lstrs;i++)
        {
           key=strs[i];
           sort(key.begin(),key.end());
           mymap[key].push_back(strs[i]);
        }
        for(auto iter=mymap.begin();iter!=mymap.end();iter++)
        {
            res.push_back(iter->second);
        }
        return res;
    }
};