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.
題意：把應(yīng)用同樣字母的單詞婴噩，放在一個(gè)里面笛洛，我這里采用的方法是排序肝陪，然后判斷是否已經(jīng)具有了這個(gè)主鍵了捌省，有的話直接放在后面兜喻，沒(méi)有的話，創(chuàng)建一個(gè)新的放在后面。
public static List<List<String>> groupAnagrams(String[] strs) {
List<List<String>> list = new ArrayList<>();
HashMap<String, Integer> helper = new HashMap<>();
for (int i = 0; i < strs.length; i++) {
char[] chars = strs[i].toCharArray();
Arrays.sort(chars);
String key = new String(chars);
if (helper.containsKey(key)) {
list.get(helper.get(key)).add(strs[i]);
} else {
List<String> temp = new ArrayList<>();
temp.add(strs[i]);
list.add(temp);
helper.put(key, list.size() - 1);
}
}
return list;
}
