首页 > itarticle > leetcode 0049

leetcode 0049

admin 11月 13, 2020 0

Desicription

Given an array of strings, group anagrams together.

For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"],
Return:

[
  ["ate", "eat","tea"],
  ["nat","tan"],
  ["bat"]
]

Note: All inputs will be in lower-case.

Solution

class  {
public:
    vector<vector<string>> groupAnagrams(vector<string>& strs) {
        sort(strs.begin(), strs.end());
        map<string, vector<string>> mp;
        int len = strs.size();
        for(int i = 0; i < len; i++){
            string tmp = strs[i];
            sort(tmp.begin(), tmp.end());
            mp[tmp].push_back(strs[i]);
        }
        vector<vector<string>> res;
        for(auto it = mp.begin(); it != mp.end(); it++)
            res.push_back(it->second);
        return res;
    }
};