-
Notifications
You must be signed in to change notification settings - Fork 0
/
Trie_208.java
89 lines (76 loc) · 2.17 KB
/
Trie_208.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
/**
* 实现一个 Trie (前缀树),包含 insert, search, 和 startsWith 这三个操作。
示例:
Trie trie = new Trie();
trie.insert("apple");
trie.search("apple"); // 返回 true
trie.search("app"); // 返回 false
trie.startsWith("app"); // 返回 true
trie.insert("app");
trie.search("app"); // 返回 true
说明:
你可以假设所有的输入都是由小写字母 a-z 构成的。
保证所有输入均为非空字符串
*
*
*/
//前缀树
class Trie {
private tireNode head;
class tireNode {
boolean isLeaf = false;
//char value;
tireNode[] tireArr;
tireNode() {
tireArr = new tireNode[26];
}
}
/** Initialize your data structure here. */
public Trie() {
this.head = new tireNode();
}
/** Inserts a word into the trie. */
public void insert(String word) {
char[] str = word.toCharArray();
tireNode cur = head;
for (char c : str) {
if (cur.tireArr[c-'a'] == null) {
cur.tireArr[c-'a'] = new tireNode();
//cur.tireArr[c-'a'].value = c;
}
cur = cur.tireArr[c-'a'];
}
cur.isLeaf = true;
}
/** Returns if the word is in the trie. */
public boolean search(String word) {
char[] str = word.toCharArray();
tireNode cur = head;
for (char c : str) {
if (cur.tireArr[c-'a'] == null) {
return false;
}
cur = cur.tireArr[c-'a'];
}
return cur.isLeaf;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
public boolean startsWith(String prefix) {
char[] str = prefix.toCharArray();
tireNode cur = head;
for (char c : str) {
if (cur.tireArr[c-'a'] == null) {
return false;
}
cur = cur.tireArr[c-'a'];
}
return true;
}
}
/**
* Your Trie object will be instantiated and called as such:
* Trie obj = new Trie();
* obj.insert(word);
* boolean param_2 = obj.search(word);
* boolean param_3 = obj.startsWith(prefix);
*/