| 19 | import java.util.*; |
| 20 | class Solution { |
| 21 | public List<List<String>> groupAnagrams(String[] strs){ |
| 22 | List<List<String>> list = new ArrayList<List<String>>(); |
| 23 | HashMap<String,Integer> set = new HashMap<>(); |
| 24 | int j = 0; |
| 25 | for(int i=0;i<strs.length;++i){ |
| 26 | char c[]= strs[i].toCharArray(); |
| 27 | Arrays.sort(c); |
| 28 | String s = new String(c); |
| 29 | if(set.containsKey(s)){ |
| 30 | list.get(set.get(s)).add(strs[i]); |
| 31 | } |
| 32 | else{ |
| 33 | list.add(new ArrayList<String>()); |
| 34 | set.put(s,j++); |
| 35 | list.get(set.get(s)).add(strs[i]); |
| 36 | } |
| 37 | } |
| 38 | return list; |
| 39 | } |
| 40 | } |