LeetCode: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.

跟之前那道题差不多，就是先将其进行字典排序然后利用哈希的性质将其分组。

AC:

class Solution {public:    vector<vector<string>> groupAnagrams(vector<string>& strs) {        int len = strs.size();        vector<vector<string> > ret;        map<string, vector<string>> mv;        for (int i = 0; i < len; i++)        {            string temp = strs[i];            sort(temp.begin(),temp.end());            mv[temp].push_back(strs[i]);        }        map<string, vector<string> >::iterator iter;        for ( iter = mv.begin(); iter != mv.end(); iter++)            ret.push_back(iter->second);        return ret;    }};