-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDictionary.java
More file actions
241 lines (233 loc) · 4.43 KB
/
Dictionary.java
File metadata and controls
241 lines (233 loc) · 4.43 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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
import java.util.ArrayList;
import java.util.List;
public class Dictionary {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
String[] word = {"abcd", "aca", "acab", "aba", "ada", "axyz", "zthf", "cdefgg"};
Dict dict = new Dict();
for(String w: word)
dict.insert(w);
dict.printWords("");
System.out.println(dict.matchWord("axyz"));
System.out.println(dict.matchWord("aaaa"));
System.out.println(dict.matchWord("cdefgg"));
System.out.println(dict.matchPattern("a.a", ""));
System.out.println(dict.matchPattern("a*cab*", ""));
System.out.println(dict.matchPattern("a.*", ""));
}
}
class Dict{
Dict[] children;
boolean isWord;
public Dict(){
children = new Dict[26];
isWord = false;
}
public List<String> matchPattern(String w, String s){
List<String> result = new ArrayList<String>();
if(w.length() == 0){
if(isWord)
result.add(s);
}
else if(w.length() > 0){
if(w.length() > 1){
if(w.charAt(1) == '*'){
char c = w.charAt(0);
result.addAll(matchPattern(w.substring(2),
s));
if(c != '.'){
if(children[getCode(c)] != null)
result.addAll(children[getCode(c)].matchPattern(w,
s + String.valueOf(c)));
}
else{
for(int i = 0; i < children.length; ++i)
if(children[i] != null)
result.addAll(children[i].matchPattern(w,
s + String.valueOf(getChar(i))));
}
}
else{
char c = w.charAt(0);
if(c != '.'){
if(children[getCode(c)] != null)
result.addAll(children[getCode(c)].matchPattern(w.substring(1),
s + String.valueOf(c)));
}
else{
for(int i = 0; i < children.length; ++i)
if(children[i] != null)
result.addAll(children[i].matchPattern(w.substring(1),
s + String.valueOf(getChar(i))));
}
}
}
else{
char c = w.charAt(0);
if(c != '.'){
if(children[getCode(c)] != null)
result.addAll(children[getCode(c)].matchPattern(w.substring(1),
s + String.valueOf(c)));
}
else{
for(int i = 0; i < children.length; ++i)
if(children[i] != null)
result.addAll(children[i].matchPattern(w.substring(1),
s + String.valueOf(getChar(i))));
}
}
}
return result;
}
public boolean matchWord(String w){
if(w.length() == 0)
return isWord;
else{
char c = w.charAt(0);
if(children[getCode(c)] != null)
return children[getCode(c)].matchWord(w.substring(1));
else
return false;
}
}
public void printWords(String w){
if(isWord)
System.out.println(w);
//else{
for(int i = 0; i < children.length; ++i){
if(children[i] != null){
children[i].printWords(w + String.valueOf(getChar(i)));
}
}
//}
}
public void insert(String word){
if(word.length() > 0){
if(children[getCode(word.charAt(0))] == null)
children[getCode(word.charAt(0))] = new Dict();
children[getCode(word.charAt(0))].insert(word.substring(1));
}
else{
isWord = true;
}
}
private char getChar(int a){
switch(a){
case 0:
return 'a';
case 1:
return 'b';
case 2:
return 'c';
case 3:
return 'd';
case 4:
return 'e';
case 5:
return 'f';
case 6:
return 'g';
case 7:
return 'h';
case 8:
return 'i';
case 9:
return 'j';
case 10:
return 'k';
case 11:
return 'l';
case 12:
return 'm';
case 13:
return 'n';
case 14:
return 'o';
case 15:
return 'p';
case 16:
return 'q';
case 17:
return 'r';
case 18:
return 's';
case 19:
return 't';
case 20:
return 'u';
case 21:
return 'v';
case 22:
return 'w';
case 23:
return 'x';
case 24:
return 'y';
case 25:
return 'z';
default:
return ' ';
}
}
private int getCode(char a){
switch(a){
case 'a':
return 0;
case 'b':
return 1;
case 'c':
return 2;
case 'd':
return 3;
case 'e':
return 4;
case 'f':
return 5;
case 'g':
return 6;
case 'h':
return 7;
case 'i':
return 8;
case 'j':
return 9;
case 'k':
return 10;
case 'l':
return 11;
case 'm':
return 12;
case 'n':
return 13;
case 'o':
return 14;
case 'p':
return 15;
case 'q':
return 16;
case 'r':
return 17;
case 's':
return 18;
case 't':
return 19;
case 'u':
return 20;
case 'v':
return 21;
case 'w':
return 22;
case 'x':
return 23;
case 'y':
return 24;
case 'z':
return 25;
default:
return -1;
}
}
}