首页 > 其他 > 详细

leetcode 49. Group Anagrams

时间:2019-02-23 11:43:17      阅读:162      评论:0      收藏: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.
  • The order of your output does not matter.

很多java的接口还是不熟练。

class Solution {
    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<>();
        for(String s: strs){
            char[] ca = s.toCharArray();
            Arrays.sort(ca);
            String keyStr = String.valueOf(ca); //将char数组合并成一个string
            if(! map.containsKey(keyStr)) map.put(keyStr, new ArrayList<String>()); //map的添加
            map.get(keyStr).add(s);
        }
        return new ArrayList<List<String>>(map.values());
    }
}

 

leetcode 49. Group Anagrams

原文:https://www.cnblogs.com/jamieliu/p/10421865.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!