Trie
- trie是一种多叉树
- 专门处理字符串
- 查询每个条目的时间复杂度,和字典映射中一共多少条目无关
- 其时间复杂度为O(w),w为所查询单词的长度
- 大多数单词的长度小于10(优势)
211. 添加与搜索单词 - 数据结构设计
设计一个支持以下两种操作的数据结构:
void addWord(word)
bool search(word)
search(word) 可以搜索文字或正则表达式字符串,字符串只包含字母 . 或 a-z 。 . 可以表示任何一个字母。
示例:
addWord(“bad”)
addWord(“dad”)
addWord(“mad”)
search(“pad”) -> false
search(“bad”) -> true
search(".ad") -> true
search(“b…”) -> true
说明:
你可以假设所有单词都是由小写字母 a-z 组成的。
class WordDictionary {
private class Node {//节点
boolean isEnd;
Node[] next;//每个节点有26个子节点
Node() {
isEnd = false;
next = new Node[26];
}
}
private Node root;
/** Initialize your data structure here. */
public WordDictionary() {
root = new Node();
}
/** Adds a word into the data structure. */
public void addWord(String word) {//添加字符串
Node curr = root;
int index = 0;
for (int i = 0; i < word.length(); i++) {
char c = word.charAt(i);
index = c - 'a';
if (curr.next[index] == null) {
curr.next[index] = new Node();
}
curr = curr.next[index];
}
curr.isEnd = true;
}
/** Returns if the word is in the data structure. A word could contain the dot character '.' to represent any one letter. */
public boolean search(String word) {
return heleper(word, 0, root);
}
private boolean heleper(String word, int len, Node root) {
//递归出口
if (word.length() == len && root.isEnd) return true;
if (word.length() == len) return false;
char c = word.charAt(len);
int index = c - 'a';
//通配符
if (c == '.') {
for (int i = 0; i < 26; i++) {
if (root.next[i] != null) {
Node curr = root.next[i];
if (heleper(word, len + 1, curr)) {
return true;
}
}
}
} else {
root = root.next[index];
if (root == null) return false;
return heleper(word, len + 1, root);
}
return false;
}
}
/**
* Your WordDictionary object will be instantiated and called as such:
* WordDictionary obj = new WordDictionary();
* obj.addWord(word);
* boolean param_2 = obj.search(word);
*/