[LeetCode]049-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:

For the return value, each inner list's elements must follow the lexicographic order.
All inputs will be in lower-case.

Solution：
可以使用map数据结构存储，map

class Solution {
public:
    vector<vector<string>> groupAnagrams(vector<string>& strs) 
    {
        map<string,int> search_map;
        vector<vector<string>> ret;
        sort(strs.begin(),strs.end());
        for(int i = 0; i < strs.size();i++)
        {
            string temp = strs[i];
            sort(temp.begin(),temp.end()); //sort temp
            if(search_map.find(temp) == search_map.end())
            {
                //can't find
                vector<string> s;
                s.push_back(strs[i]);
                ret.push_back(s);
                int index = ret.size()-1;
                search_map.insert(pair<string,int>(temp,index));
            }
            else
            {
                int index = search_map[temp];
                ret[index].push_back(strs[i]);
            }
        }

        return ret;
    }
};