49. Group Anagrams

最新推荐文章于 2024-01-10 12:48:22 发布

原创最新推荐文章于 2024-01-10 12:48:22 发布 · 314 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种用于将字符串数组中所有字母异位词进行分组的高效算法。通过使用哈希映射，该算法能够根据字母异位词的排序字符对其进行分组，从而实现快速查找和归类。

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:
    vector<vector<string>> groupAnagrams(vector<string>& strs) {
        if(strs.size()==0) return vector<vector<string> >();
        vector<vector<string> > ret;
        int len = strs.size();
        string temp;
        unordered_map<string, vector<string> > mp;
        for(int i=0; i<len; i++)
        {
            temp = strs[i];
            sort(temp.begin(), temp.end());
            mp[temp].push_back(strs[i]);
        }
        unordered_map<string, vector<string> >::iterator mp_iterator = mp.begin();
        for(; mp_iterator!=mp.end(); mp_iterator++)
        {
            ret.push_back(mp_iterator->second);
        }
        return ret;
        
    }
};