forked from ppsirker/dsalgo
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFindOrderOfLetter.java
102 lines (95 loc) · 2.22 KB
/
FindOrderOfLetter.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
95
96
97
98
99
100
101
102
/*
For problem and solution description please visit the link below
http://www.dsalgo.com/2013/02/FindOrderOfLetter.php.html
*/
package com.dsalgo;
import java.util.HashMap;
public class FindOrderOfLetter
{
public static void main(String[] args)
{
String[] words =
{ "car", "cat", "cbr", "deer", "egg", "god", "rabe", "race", "rat",
"tar" };
char[] letters = getLetterOrdering(words);
if (letters == null)
System.out.println("not possible");
else
{
for (char ch : letters)
System.out.print(ch + ",");
}
}
private static char[] getLetterOrdering(String[] words)
{
HashMap<Character, Integer> characters = new HashMap<Character, Integer>();
for (String word : words)
{
for (int i = 0; i < word.length(); ++i)
{
char character = word.charAt(i);
if (!characters.keySet().contains(character))
{
characters.put(character, characters.size());
}
}
}
boolean[][] adjacency = new boolean[characters.size()][characters
.size()];
for (int i = 0; i < words.length - 1; ++i)
{
for (int j = i + 1; j < words.length; ++j)
{
String prevWord = words[i];
String nextWord = words[j];
for (int k = 0; k < Math.min(prevWord.length(),
nextWord.length()); ++k)
{
char prevCharacter = prevWord.charAt(k);
char nextCharacter = nextWord.charAt(k);
if (prevCharacter != nextCharacter)
{
adjacency[characters.get(prevCharacter)][characters
.get(nextCharacter)] = true;
break;
}
}
}
}
char[] result = new char[characters.size()];
int resultIndex = 0;
while (!characters.isEmpty())
{
char lowChar = ' ';
for (Character nextCharacter : characters.keySet())
{
int nextIndex = characters.get(nextCharacter);
boolean lowest = true;
for (Character prevCharacter : characters.keySet())
{
int prevIndex = characters.get(prevCharacter);
if (adjacency[prevIndex][nextIndex])
{
lowest = false;
break;
}
}
if (lowest)
{
lowChar = nextCharacter;
result[resultIndex++] = nextCharacter;
break;
}
}
if (lowChar == ' ')
{
return null;
} else
{
characters.remove(lowChar);
lowChar = ' ';
}
}
return result;
}
}