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.

解题思路：使用hashtable，把输入字符串排序后的字符串作为key，源字符串加入到value中，

这样具有相同字符的字符串就位于同一个key的value中

AC代码如下：

class Solution {
public:
	vector<vector<string>> groupAnagrams(vector<string>& strs) {
		vector<vector<string>> ans;
		if (strs.size() == 0) return ans;
		int n = strs.size();
		unordered_map<string, vector<string>> stats;
		for (int i = 0; i < n; ++i){
			string tmp = strs[i];
			sort(tmp.begin(), tmp.end());
			stats[tmp].push_back(strs[i]);
		}
		unordered_map<string, vector<string>>::iterator it = stats.begin();
		for (; it != stats.end(); ++it){
			ans.push_back(it->second);
		}
		return ans;
	}
};