题目链接
题目描述
Trie(发音类似 "try")或者说 前缀树 是一种树形数据结构,用于高效地存储和检索字符串数据集中的键。这一数据结构有相当多的应用情景,例如自动补完和拼写检查。
请你实现 Trie 类:
Trie() 初始化前缀树对象。
void insert(String word) 向前缀树中插入字符串 word 。
boolean search(String word) 如果字符串 word 在前缀树中,返回 true(即,在检索之前已经插入);否则,返回 false 。
boolean startsWith(String prefix) 如果之前已经插入的字符串 word 的前缀之一为 prefix ,返回 true ;否则,返回 false 。
示例:
输入
inputs = ["Trie", "insert", "search", "search", "startsWith", "insert", "search"]
inputs = [[], ["apple"], ["apple"], ["app"], ["app"], ["app"], ["app"]]
输出
[null, null, true, false, true, null, true]解释
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
提示:
1 <= word.length, prefix.length <= 2000
word 和 prefix 仅由小写英文字母组成
insert、search 和 startsWith 调用次数 总计 不超过 3 * 104 次
解题思路
哈希表,键为下一个字符,值为指向下个结点的指针
代码
Python
class TrieNode:
def __init__(self, char=''):
self.char = char
self.childs = {}
class Trie:
def __init__(self):
"""
Initialize your data structure here.
"""
self.root = TrieNode()
def insert(self, word: str) -> None:
"""
Inserts a word into the trie.
"""
node = self.root
for i in range(len(word)):
if node.childs.get(word[i], 0) == 0:
node.childs[word[i]] = TrieNode(word[i])
node = node.childs[word[i]]
else:
node = node.childs[word[i]]
node.childs[''] = '.' # 结束符号
return
def search(self, word: str) -> bool:
"""
Returns if the word is in the trie.
"""
node = self.root
for i in range(len(word)):
if node.childs.get(word[i], 0) == 0:
return False
else:
node = node.childs[word[i]]
if node.childs.get('', 0) == '.':
return True
return False
def startsWith(self, prefix: str) -> bool:
"""
Returns if there is any word in the trie that starts with the given prefix.
"""
node = self.root
for i in range(len(prefix)):
if node.childs.get(prefix[i], 0) == 0:
return False
else:
node = node.childs[prefix[i]]
return True
# Your Trie object will be instantiated and called as such:
# obj = Trie()
# obj.insert(word)
# param_2 = obj.search(word)
# param_3 = obj.startsWith(prefix)
Go
type Trie struct {
childs [26]*Trie
isEnd bool
}
/** Initialize your data structure here. */
func Constructor() Trie {
return Trie{}
}
/** Inserts a word into the trie. */
func (this *Trie) Insert(word string) {
node := this
for _, chr := range word {
idx := chr - 'a'
if node.childs[idx] == nil {
node.childs[idx] = &Trie{}
}
node = node.childs[idx]
}
node.isEnd = true
}
/** Returns if the word is in the trie. */
func (this *Trie) Search(word string) bool {
node := this
for _, chr := range word {
idx := chr - 'a'
if node.childs[idx] == nil {
return false
}
node = node.childs[idx]
}
return node.isEnd
}
/** Returns if there is any word in the trie that starts with the given prefix. */
func (this *Trie) StartsWith(prefix string) bool {
node := this
for _, chr := range prefix {
idx := chr - 'a'
if node.childs[idx] == nil {
return false
}
node = node.childs[idx]
}
return true
}