LeetCode 49. Group Anagrams (哈希表)

这道题肯定是哈希表了，我一开始很傻的自己写了个哈希函数，还是一看就知道是会有重合的那种哈希函数

算了 还是用自带的unordered map吧 = =  

进行哈希判断重复之前先排个序，原来string还有string.begin( )这个东西，毕竟string也是可以迭代的XDD

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) {
        vector < vector <string> > res;

		unordered_map<string, int> M;
		int cnt = -1;
		for (int i = 0; i < strs.size(); i++) {
			string s = strs[i];
			sort(s.begin(), s.end());

			if (M.find(s) == M.end()) {    //couldn't find, build a new one
				vector<string> temp;
				temp.push_back(strs[i]);
				res.push_back(temp);

				M.insert(make_pair(s, ++cnt)); //cnt stand for the position in res;
			}
			else {                        //find, then append
				int index = M[s];
				res[index].push_back(strs[i]);
			}
		}
		return res;
	}
    
};