题目:
实现一个 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
思路:
这题的重点是设计一个前缀节点结构,子节点有26个指针数组
class Trie {
private class TrieNode {
TrieNode[] child;
boolean isEnd;
public TrieNode() {
this.child = new TrieNode[26];
this.isEnd = false;
}
}
private TrieNode root;
/** Initialize your data structure here. */
public Trie() {
root = new TrieNode();
}
/** Inserts a word into the trie. */
public void insert(String word) {
TrieNode p = root;
for(int i=0;i<word.length();i++){
char c = word.charAt(i);
if(p.child[c-'a']==null){
p.child[c-'a'] = new TrieNode();
}
p = p.child[c-'a'];
}
p.isEnd = true;
}
/** Returns if the word is in the trie. */
public boolean search(String word) {
TrieNode p = root;
for(int i=0;i<word.length();i++){
char c = word.charAt(i);
if(p.child[c-'a']==null){
return false;
}
p = p.child[c-'a'];
}
return p.isEnd;
}
/** Returns if there is any word in the trie that starts with the given prefix. */
public boolean startsWith(String prefix) {
TrieNode p = root;
for(int i=0;i<prefix.length();i++){
char c = prefix.charAt(i);
if(p.child[c-'a']==null){
return false;
}
p = p.child[c-'a'];
}
return true;
}
}