#49 Group Anagrams

Description

Given an array of strings, group anagrams together.

Note:
All inputs will be in lowercase.
The order of your output does not matter.

Example

Input: [“eat”, “tea”, “tan”, “ate”, “nat”, “bat”],
Output: [[“ate”,“eat”,“tea”],[“nat”,“tan”],[“bat”]]

解题思路

总体思路就是用map映射
关键在映射方式
有两种（以 { " a a b " , " a b c " , " b a a " } \{"aab", "abc", "baa"\} {"aab","abc","baa"} 为例）

• 字母序排序后的char数组映射
  $$\begin{gathered} "aab":"aab"、"baa" \\ "abc":"abc" \end{gathered}$$
• 26个字母的出现频次$int[26]$映射
  $$\begin{gathered} "2\#1\#0\#0\#0....\#0":"aab"、"baa" \\ "1\#1\#1\#0\#0\#...\#0":"abc" \end{gathered}$$

给出的代码是第一种的（实际时间复杂度是第二种好，但是一开始没想到可以用数组作为key，所以用第一种方法做的）

class Solution {
    public List<List<String>> groupAnagrams(String[] strs) {
        int i;
        int num = strs.length;
        Map<String, List<String>> map = new HashMap<>();
        for(i = 0; i < num; i++){
            char[] temp = strs[i].toCharArray();
            Arrays.sort(temp);
            String t = String.valueOf(temp);
            if(!map.keySet().contains(t))
                map.put(t, new ArrayList<>());
            List<String> get = map.get(t);
            get.add(strs[i]);
            map.put(t, get);
        }
        List<List<String>> answer = new ArrayList<>();
        for(String key: map.keySet()){
            answer.add(map.get(key));
        }
        return answer;
    } 
}