LeetCode·49. Group Anagrams

最新推荐文章于 2022-07-18 21:37:42 发布

seuStones

最新推荐文章于 2022-07-18 21:37:42 发布

阅读量167

点赞数

分类专栏： Informal essay

本文链接：https://blog.csdn.net/u010189457/article/details/81566280

版权

Informal essay 专栏收录该内容

25 篇文章 0 订阅

订阅专栏

题目：

49. Group Anagrams

Given an array of strings, group anagrams together.

Example:

Input: ["eat", "tea", "tan", "ate", "nat", "bat"],
Output:
[
  ["ate","eat","tea"],
  ["nat","tan"],
  ["bat"]
]
Note:

·All inputs will be in lowercase.
·The order of your output does not matter.

思路：

哈希表
统计排序

代码：

class Solution {
public:
    string helpSort(string str){
        vector<int> countv(26, 0);
        for(int i = 0; i < str.size(); ++i){
            ++countv[str[i]-'a'];
        }
        string res = "";
        for(int i = 0; i < 26; ++i){
            while(countv[i]--)
                res += 'a'+i;
        }

        return res;
    }

    vector<vector<string>> groupAnagrams(vector<string>& strs) {
        vector<vector<string>> res;
        if(strs.size() < 1)
            return res;

        unordered_map<string, vector<string>> mm;
        for(string str : strs){
            string tmp = str;
            tmp = helpSort(tmp);
            mm[tmp].push_back(str);
        }

        for(auto m : mm){
            res.push_back(m.second);
        }

        return res;
    }
};