(Java)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

这一题我是这么想的，将每个字符串排好序后，作为Hashmap的Key，排序之前的字符串作为value，最后将所有的value放入一个List里即可

代码如下：

public List<List<String>> groupAnagrams(String[] strs) {
		Map<String,List<String>> map = new HashMap<String, List<String>>();
		for(String str : strs){
			char[] ch = str.toCharArray();
			Arrays.sort(ch);
			String temp = (new String(ch));
			if(map.containsKey(temp)){
				map.get(temp).add(str);
			}else{
				List<String> list = new ArrayList<String>();
				list.add(str);
				map.put(temp, list);
			}
		}
		Iterator<Map.Entry<String, List<String>>> iter = map.entrySet().iterator();
		List<List<String>> result = new ArrayList<List<String>>();
		while(iter.hasNext()){
			Map.Entry<String, List<String>> entry = (Map.Entry<String, List<String>>)iter.next();
	//		System.out.println(entry.getValue());
			result.add(entry.getValue());
		}
		return result;
    }

不过我在discuss里看到一种超快的解法，很巧妙，连接是 https://discuss.leetcode.com/topic/45639/java-beat-100-use-prime-number