class Trie {
/** Initialize your data structure here. */
TrieNode root;
public Trie() {
root = new TrieNode();
}
/** Inserts a word into the trie. */
public void insert(String word) {
TrieNode node = root;
for(int i = 0; i < word.length(); i++){
char val = word.charAt(i);
if(node.children == null) node.children = new HashMap();
if(!node.children.containsKey(val)){
node.children.put(val, new TrieNode(val));
}
node = node.children.get(val);
}
node.leaf = true;
}
/** Returns if the word is in the trie. */
public boolean search(String word) {
TrieNode node = root;
for(int i = 0; i < word.length(); i++){
char c = word.charAt(i);
if(node.children == null || !node.children.containsKe
字典树(Trie Tree)java 模板
最新推荐文章于 2024-04-23 06:32:07 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)