Leetcode 49 Group Anagrams

triplebee

发布于 2018-01-12 15:07:09

6070

发布于 2018-01-12 15:07:09

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.

将组成字母相同的单词归为一类。

做个简单映射就好了

class Solution {
public:
    vector<vector<string>> groupAnagrams(vector<string>& strs) {
        vector<vector<string>> result;
        unordered_map<string,int> mp;
        int cnt=0;
        for(int i=0;i<strs.size();i++)
        {
            string temp=strs[i];
            sort(temp.begin(),temp.end());
            if(mp.find(temp)==mp.end())
            {
                vector<string> s;
                s.push_back(strs[i]);
                result.push_back(s);
                mp[temp]=cnt++;
            }
            else
                result[mp[temp]].push_back(strs[i]);
        }
        return result;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2016-09-12 ，如有侵权请联系 cloudcommunity@tencent.com 删除

nat