【LeetCode】【HOT】49. 字母异位词分组（递归）

【LeetCode】【HOT】49. 字母异位词分组

package hot;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class Solution49 {
    public static void main(String[] args) {
        String[] strs = {"eat","tea","tan","ate","nat","bat"};
        Solution49 solution = new Solution49();
        System.out.println(solution.method(strs));
    }

    private List<List<String>> method(String[] strs){
        Map<String, List<String>> map = new HashMap<>();
        for(String str : strs){
            char[] array = str.toCharArray();
            Arrays.sort(array);
            String key = new String(array);
            List<String> list = map.getOrDefault(key, new ArrayList<String>());
            list.add(str);
            map.put(key,list);
        }
        return new ArrayList<List<String>>(map.values());
    }
}

//时间复杂度为 O(nlogn)
//空间复杂度为 O(n)