[Leetcode] 49. Group Anagrams

题目：
链接 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.

思路：
使用Map

具体代码如下：

public class Solution {
    public List<List<String>> groupAnagrams(String[] strs) {
        List<List<String>> result = new ArrayList();
        Map<String,List<String>> map = new HashMap();
        for(String s : strs){
            char[] c = s.toCharArray();
            Arrays.sort(c);
            String str =String.valueOf(c);
            if(!map.containsKey(str)){
                map.put(str, new ArrayList<String>());
            }
            map.get(str).add(s);
        }
        for(String s: map.keySet()){
            result.add(map.get(s));
        }
        return result;
    }
}