LeetCode 49. Group Anagrams

原题链接在这里：https://leetcode.com/problems/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.

题解：

用sort的方式找出anagram的base型，用来当HashMap的key.

Time Complexity: O(nlogn * strs.length), n是strs中最长string的长度. Space: O(hm.size()), HashMap size.

AC Java:

class Solution {
    public List<List<String>> groupAnagrams(String[] strs) {
        HashMap<String, List<String>> hm = new HashMap<>();
        for(String s : strs){
            char [] sArr = s.toCharArray();
            Arrays.sort(sArr);
            String sortedStr = new String(sArr);
            
            hm.putIfAbsent(sortedStr, new ArrayList<>());
            hm.get(sortedStr).add(s);
        }
        
        return new ArrayList<List<String>>(hm.values());
    }
}

类似Group Shifted Strings.