【Java】【LeetCode】49. Group Anagrams

题目：

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.

题目大意：给出一个字符串数组，将其按照组成字母相同这一条件来分组，即组成字符串的字符完全相同的字符串分成一组。
解题思路：

         采用HashMap<String,List<String>>，每次讲读入的字符串在map中查找（这里需将读入的字符串转化成数组后用sort（）来排列好）。

代码如下：

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class GroupAnagrams {

    public static void main(String[] args) {
        /**
         * Example:
         * 
         * Input: ["eat", "tea", "tan", "ate", "nat", "bat"], Output: [
         * ["ate","eat","tea"], ["nat","tan"], ["bat"] ]
         */
        String[] strs = { "eat", "tea", "tan", "ate", "nat", "bat" };
        System.out.println(groupAnagrams(strs));
    }

    public static List<List<String>> groupAnagrams(String[] strs) {
        List<List<String>> result = new ArrayList<List<String>>();
        if (strs == null) {
            return result;
        }
        Map<String, List<String>> map = new HashMap<String, List<String>>();
        for (int i = 0; i < strs.length; i++) {
            String str = strs[i];
            char[] charArray = str.toCharArray();
            Arrays.sort(charArray);
            String key = new String(charArray);
            if (map.containsKey(key)) {
                List<String> list = new ArrayList<String>(map.get(key));
                list.add(strs[i]);
                map.put(key, list);
            } else {
                map.put(key, Arrays.asList(str));
            }
        }
        for (List<String> value : map.values()) {
            result.add(value);
        }
        return result;
    }

}