LeetCode 49. Group Anagrams

描述

把由相同字符构成的字符串，组成一个字符串向量，分别存在一起

解决

涉及到1对多的问题，利用map即可

---

class Solution {
public:
    vector<vector<string>> groupAnagrams(vector<string>& strs) {
        unordered_map<string, vector<string>> m1;
        for (auto val : strs)
        {
            string tmp = val;
            sort(tmp.begin(), tmp.end());
            m1[tmp].push_back(val);
        }
        vector<vector<string>> res;
        for (auto it = m1.begin(); it != m1.end(); ++it)
        {
            res.push_back(it -> second);
        }
        return res;
    }
};