forked from Blankj/awesome-java-leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
GroupAnagrams.java
94 lines (76 loc) · 2.21 KB
/
GroupAnagrams.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
package hashtable;
import java.util.*;
// https://leetcode.com/problems/group-anagrams/
public class GroupAnagrams {
public static void main(String[] args) {
String[] inputs = {"eat","tea","tan","ate","nat","bat"};
GroupAnagrams obj = new GroupAnagrams();
obj.groupAnagrams(inputs);
}
public List<List<String>> groupAnagramsWithCharCount(String[] strs) {
// edge check
if (strs == null || strs.length == 0) {
return null;
}
Map<String, List<String>> map = new HashMap<>();
int[] charCountArray = new int[26];
// build map
for (String s: strs) {
Arrays.fill(charCountArray, 0);
for (char c: s.toCharArray()) {
charCountArray[(c - 'a')]++;
}
StringBuilder sb = new StringBuilder();
for (int i: charCountArray) {
sb.append('#');
sb.append(i);
}
String sortItem = sb.toString();
if (!map.containsKey(sortItem)) {
map.put(sortItem, new ArrayList<String>());
}
map.get(sortItem).add(s);
}
return new ArrayList<>(map.values());
}
private String sort(String input) {
char[] chars = input.toCharArray();
Arrays.sort(chars);
return new String(chars);
}
public List<List<String>> groupAnagramsWithMap(String[] strs) {
// edge check
if (strs == null || strs.length == 0) {
return null;
}
Map<String, List<String>> map = new HashMap<>();
// build map
for (String s: strs) {
String sortItem = sort(s);
if (!map.containsKey(sortItem)) {
map.put(sortItem, new ArrayList<String>());
}
map.get(sortItem).add(s);
}
return new ArrayList<>(map.values());
}
public List<List<String>> groupAnagrams(String[] strs) {
List<List<String>> result = new ArrayList<>();
for (String s: strs) {
String sortString = sort(s);
boolean isSame = false;
for (List<String> list: result) {
String item = list.get(0);
if (sortString.length() == item.length() && sort(item).equals(sortString)) {
list.add(s);
isSame = true;
break;
}
}
if (isSame == false) {
result.add(new ArrayList<>(Arrays.asList(s)));
}
}
return result;
}
}