leetcode 49. Group Anagrams

leetcode  49. Group Anagrams

很久·没刷leetcode,逐渐手生了。

下面的代码不知道为何不能acc

错误为：

public class Solution {
	Set<Character> genCharSet(String s){
		Set<Character> res =  new HashSet<Character>();
		for(int i=0;i<s.length();i++){
			res.add(s.charAt(i));
		}
		return res;
	}

	public List<List<String>> groupAnagrams(String[] strs) {
    	List<Set<Character>> arr = new ArrayList<Set<Character>>();
    	List<List<String>> res = new ArrayList<List<String>>();
    	for(String s:strs){
    		Set<Character> sset = genCharSet(s);
    		
    		if(arr.contains(sset)){
    			res.get(arr.indexOf(sset)).add(s);
    		}else{
    			arr.add(sset);
    			res.add(new ArrayList<String>());
    			res.get(arr.indexOf(sset)).add(s);
    		}
    	}
    	return res;
    }
	
	
	public static void main(String[] args){
		Solution s = new Solution();
		String[] strs = {""};
		s.groupAnagrams(strs);
	}
}

Solution 里提供的答案，利用质数来求解，很巧妙地说

public static 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};//最多10609个z
    
            List<List<String>> res = new ArrayList<>();
            HashMap<Integer, Integer> map = new HashMap<>();
            for (String s : strs) {
                int key = 1;
                for (char c : s.toCharArray()) {
                    key *= prime[c - 'a'];
                }
                List<String> t;
                if (map.containsKey(key)) {
                    t = res.get(map.get(key));
                } else {
                    t = new ArrayList<>();
                    res.add(t);
                    map.put(key, res.size() - 1);
                }
                t.add(s);
            }
            return res;
    }