leetcode#49. Group Anagrams

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 List<List<String>> groupAnagrams(String[] strs) {
   
        /*
        if(strs == null || strs.length == 0){
            return new ArrayList<>();
            
        }
        
        Arrays.sort(strs);
        Map<String, List<String>> map = new HashMap<>();
        for(String str: strs){
                
                char[] cs = str.toCharArray();
                //将char 按照字典顺序排序
                Arrays.sort(cs);
                String sortStr = String.valueOf(cs);
                
            
            if(!map.containsKey(sortStr)){
                map.put(sortStr, new ArrayList<>());
            }
            map.get(sortStr).add(str);
                
        }
        
        return new ArrayList<>(map.values());
        */
        
        
        Map<String,List<String>> map = new HashMap<>();
        
        for(String str:strs){
            char[] letters = str.toCharArray();
            Arrays.sort(letters);
            String newStr = String.valueOf(letters);
            if(!map.containsKey(newStr)){
                map.put(newStr, new ArrayList<>());
            }
            map.get(newStr).add(str);
            
        }
        
        return new ArrayList<List<String>>(map.values());
    }
}