[LeetCode] Anagrams

最新推荐文章于 2020-07-07 20:25:37 发布

hale1007

最新推荐文章于 2020-07-07 20:25:37 发布

阅读量928

点赞数

分类专栏： Algorithm LeetCode

本文链接：https://blog.csdn.net/hale1007/article/details/25700023

版权

Algorithm 同时被 2 个专栏收录

86 篇文章 0 订阅

订阅专栏

LeetCode

76 篇文章 0 订阅

订阅专栏

Given an array of strings, return all groups of strings that are anagrams.

Note: All inputs will be in lower-case.

class Solution {
public:
    vector<string> anagrams(vector<string> &strs) {
        vector<string> res;
        map<string, vector<string>> mp;
        for(const auto &s : strs)
        {
            string key(s);
            sort(key.begin(), key.end());
            mp[key].push_back(s);
        }
        for(auto it = mp.begin(); it != mp.end(); ++it)
        {
            if(it->second.size() > 1)
                res.insert(res.end(), it->second.begin(), it->second.end());
        }
        return res;
    }
};