java算法（5）

原题：

// 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 class Solution {

    public List<List<String>> groupAnagrams(String[] strs) {

        if(strs == null || strs.length == 0) return new ArrayList<List<String>>();

        HashMap<String, ArrayList<String>> map = new HashMap<String, ArrayList<String>>();

        Arrays.sort(strs);

        for(String s : strs) {

            char[] characters = s.toCharArray();

            Arrays.sort(characters);

            String key = String.valueOf(characters);

            if(!map.containsKey(key)) map.put(key, new ArrayList<String>());

            map.get(key).add(s);

        }

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

    }

}