49. Group Anagrams**

最新推荐文章于 2022-11-17 15:00:00 发布

Yingying_code

最新推荐文章于 2022-11-17 15:00:00 发布

阅读量214

点赞数

分类专栏： leetcode Java String

本文链接：https://blog.csdn.net/alwaystry/article/details/53968925

版权

leetcode 同时被 3 个专栏收录

261 篇文章 0 订阅

订阅专栏

Java

188 篇文章 0 订阅

订阅专栏

String

21 篇文章 0 订阅

订阅专栏

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.

    public List<List<String>> groupAnagrams(String[] strs) {
        if (strs==null || strs.length ==0) return new ArrayList<List<String>>();
        Map<String,List<String>> map = new HashMap<String, List<String>>();
        Arrays.sort(strs);
        for (String s:strs){
            char[] ca = s.toCharArray();
            Arrays.sort(ca);
            String keyStr = String.valueOf(ca);
            if (!map.containsKey(keyStr)) map.put(keyStr, new ArrayList<String>());
            map.get(keyStr).add(s);
        }
        return new ArrayList<List<String>>(map.values());
    }

总结：其实有点投机取巧。