Repository navigation
Expand file tree
/
Copy pathAnagram.java
More file actions
78 lines (64 loc) · 2.13 KB
/
Copy pathAnagram.java
File metadata and controls
78 lines (64 loc) · 2.13 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
72
73
74
75
76
77
78
package array;
import array.algo_company.DataStructure.dynamicarray.DynamicArray;
import java.util.Arrays;
import java.util.Iterator;
import java.util.Map;
import java.util.TreeMap;
public class Anagram
{
private static int[] Track;
public static void main(String... args)
{
DynamicArray<String> dynamicArray = new DynamicArray<>(4);
dynamicArray.add("Listen");
dynamicArray.add("Silent");
dynamicArray.add("Enlist");
dynamicArray.add("Ama");
dynamicArray.add("Sas");
dynamicArray.add("Ass");
dynamicArray.add("Check");
Track = new int[dynamicArray.size()];
TreeMap<String,String> anagramMap = new TreeMap<>();
fillAnagram(anagramMap,dynamicArray);
Iterator<Map.Entry<String,String>> anagIterator = anagramMap.entrySet().iterator();
while(anagIterator.hasNext())
{
Map.Entry<String,String> entry = anagIterator.next();
System.out.println(entry.getValue());
}
}
private static void fillAnagram(TreeMap<String, String> anagramMap, DynamicArray<String> dynamicArray)
{
int size = dynamicArray.size();
for(int i = 0; i < size; i++)
{
String data = dynamicArray.get(i);
int traversed = i+1;
if(Track[i] == 1)continue;
anagramMap.put(data,data);
while(traversed != size)
{
String dataNext = dynamicArray.get(traversed);
boolean isBothAnagram = isAnagram(data,dataNext);
if(isBothAnagram)
{
anagramMap.put(data,anagramMap.get(data)+","+dataNext);
Track[traversed] = 1;
}
traversed++;
}
}
}
private static boolean isAnagram(String data, String dataNext)
{
char[] dataOld = data.toLowerCase().toCharArray();
Arrays.sort(dataOld);
char[] dataNew = dataNext.toLowerCase().toCharArray();
Arrays.sort(dataNew);
if(Arrays.equals(dataOld,dataNew))
{
return true;
}
return false;
}
}