-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGroupAnagrams_49.java
More file actions
71 lines (63 loc) · 2.4 KB
/
GroupAnagrams_49.java
File metadata and controls
71 lines (63 loc) · 2.4 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
61
62
63
64
65
66
67
68
69
70
71
package com.leetcode.problems.medium;
import java.util.*;
/**
* @author neeraj on 28/08/19
* Copyright (c) 2019, data-structures.
* All rights reserved.
*/
public class GroupAnagrams_49 {
public static void main(String[] args) {
String [] str = new String[]{"eat", "tea", "tan", "ate", "nat", "bat"};
groupAnagrams(str);
}
public static List<List<String>> groupAnagrams(String[] strs) {
String[] arrayOfSortedWords = sortAllWords(strs);
Map<String, List<String>> allAnagrams = new HashMap<>();
List<List<String>> result = new ArrayList<>();
for (int i = 0; i < arrayOfSortedWords.length; i++) {
if (allAnagrams.containsKey(arrayOfSortedWords[i])) {
allAnagrams.get(arrayOfSortedWords[i]).add(strs[i]);
} else {
List<String> anagrams = new ArrayList<>();
anagrams.add(strs[i]);
allAnagrams.put(arrayOfSortedWords[i], anagrams);
}
}
// System.out.println(allAnagrams);
allAnagrams.values().forEach(value -> result.add(value));
System.out.println(result);
return result;
}
public static String[] sortAllWords(String[] strs) {
String[] arrayOfSortedWords = new String[strs.length];
int counter = 0;
for (String str : strs) {
char[] charArr = str.toCharArray();
Arrays.sort(charArr);
arrayOfSortedWords[counter++] = new String(charArr);
}
return arrayOfSortedWords;
}
public static List<List<String>> groupAnagrams_leetcode(String[] strs) {
List<List<String>> groupedAnagrams = new ArrayList<>();
Map<String, List<String>> groupedMap = new HashMap<>();
String sortedVal = null;
for(String str: strs) {
char [] strArr = str.toCharArray();
Arrays.sort(strArr);
sortedVal = new String(strArr);
if(groupedMap.containsKey(sortedVal)) {
groupedMap.get(sortedVal).add(str);
groupedMap.put(sortedVal, groupedMap.get(sortedVal));
} else {
List<String> list = new ArrayList<>();
list.add(str);
groupedMap.put(sortedVal,list);
}
}
for(List<String> result: groupedMap.values()) {
groupedAnagrams.add(result);
}
return groupedAnagrams;
}
}