leetcode - 49.Group Anagrams

最新推荐文章于 2022-08-04 00:22:08 发布

xiedacon

最新推荐文章于 2022-08-04 00:22:08 发布

阅读量177

点赞数

分类专栏： leetcode题集文章标签： leetcode

本文链接：https://blog.csdn.net/qq_27350929/article/details/61916218

版权

leetcode题集专栏收录该内容

96 篇文章 0 订阅

订阅专栏

Group 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"]
]

Solution:

  public List<List<String>> groupAnagrams(String[] strs) {
    Map<String, List<String>> map = new HashMap<>();

    for (String str : strs) {
      char[] chars = str.toCharArray();
      Arrays.sort(chars);

      String s = String.valueOf(chars);
      if (!map.containsKey(s)) {
        map.put(s, new ArrayList<String>());
      }
      map.get(s).add(str);

    }

    return new ArrayList<List<String>>(map.values());
  }