LeetCode49 Group Anagrams

最新推荐文章于 2021-02-26 10:52:22 发布

zhangjun62

最新推荐文章于 2021-02-26 10:52:22 发布

阅读量126

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/zhangjun62/article/details/97621266

版权

LeetCode 专栏收录该内容

53 篇文章 0 订阅

订阅专栏

题目：

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.

public class GroupAnagrams {
    public static List<List<String>> groupAnagrams(String[] strs) {
        List<List<String>> ans = new ArrayList();
        if (strs.length == 0) return ans;
        Map<String, List<String>> map = new HashMap();
        for (String str : strs) {
            boolean findSame = false;
            char[] sortedArray = str.toCharArray();
            Arrays.sort(sortedArray);
            String sortedNew = new String(sortedArray);
            List<String> family = map.get(sortedNew);
            if (family != null) family.add(str);
            else
            {
                List<String> newList = new ArrayList();
                newList.add(str);
                map.put(sortedNew, newList);
                ans.add(newList);
            }
        }
        return ans;
    }

    public static void main(String[] args) {
        String[] strs ={"eat", "tea", "tan", "ate", "nat", "bat"};
        groupAnagrams(strs).stream().forEach(list-> System.out.println(list.toString()));
    }
}