【LeetCode】 049. 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"]
]

Note: All inputs will be in lower-case.

public class Solution {
    public List<List<String>> groupAnagrams(String[] strs) {
        int[] prime = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 41,
                43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103};
        List<List<String>> res = new ArrayList<List<String>>();
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        for (String s : strs) {
            int key = 1;
            for (char c : s.toCharArray()) {
                key *= prime[c - 'a'];
            }
            List<String> list;
            Integer temp = map.get(key);
            if (temp == null) {
                list = new ArrayList<String>();
                res.add(list);
                map.put(key, res.size() - 1);
            } else {
                list = res.get(temp);
            }
            list.add(s);
        }
        return res;
    }
}