-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGroupAnagrams.java
More file actions
60 lines (54 loc) · 2.18 KB
/
GroupAnagrams.java
File metadata and controls
60 lines (54 loc) · 2.18 KB
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
package solutions;
import java.util.*;
// [Problem] https://leetcode.com/problems/group-anagrams
class GroupAnagrams {
// Sorting
// O(nklog(k)) time, O(n) space
// n = number of strings, k = length of each string
public List<List<String>> groupAnagramsSorting(String[] strs) {
Map<String, List<String>> anagramGroups = new HashMap<>();
for (String str : strs) {
char[] letters = str.toCharArray();
Arrays.sort(letters);
String anagramKey = String.valueOf(letters);
if (!anagramGroups.containsKey(anagramKey)) {
anagramGroups.put(anagramKey, new ArrayList<>());
}
anagramGroups.get(anagramKey).add(str);
}
return new ArrayList<>(anagramGroups.values());
}
// Letter frequencies
// O(nk) time, O(n) space
// n = number of strings, k = length of each string
public List<List<String>> groupAnagrams(String[] strs) {
Map<String, List<String>> anagramGroups = new HashMap<>();
for (String str : strs) {
char[] letters = str.toCharArray();
int[] letterFrequencies = new int[26];
for (char letter : letters) {
letterFrequencies[letter - 'a']++;
}
String anagramKey = Arrays.toString(letterFrequencies);
if (!anagramGroups.containsKey(anagramKey)) {
anagramGroups.put(anagramKey, new ArrayList<>());
}
anagramGroups.get(anagramKey).add(str);
}
return new ArrayList<>(anagramGroups.values());
}
// Test
public static void main(String[] args) {
GroupAnagrams solution = new GroupAnagrams();
String[] input = {"eat", "tea", "tan", "ate", "nat", "bat"};
List<List<String>> expectedOutput = List.of(
List.of("eat", "tea", "ate"),
List.of("tan", "nat"),
List.of("bat")
);
List<List<String>> actualOutput = solution.groupAnagrams(input);
// compare outputs (order doesn't matter)
System.out.println("expectedOutput: " + expectedOutput);
System.out.println("actualOutput: " + actualOutput);
}
}