leetcode没做出来看答案的题

暴露出一个很严重的问题就是对stl的应用并不是非常得熟练
49. Group Anagrams
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.

Subscribe to see which companies asked this question.

class Solution {
public:
    vector<vector<string>> groupAnagrams(vector<string>& strs) {
        unordered_map<string, vector<string>> group;
        for(const auto& s : strs){
            string key = s;   //strs为引用，返回结果不需要动strs。所以拷贝下
            sort(key.begin(), key.end());  //用计数排序更优
            group[key].push_back(s);
        }

        vector<vector<string>> res;
        for(auto g : group){
            vector<string> ele(g.second.begin(), g.second.end());
            res.push_back(ele);
        }
        return res;
    }
};