208. 實現 Trie (前綴樹)

Ideas

前綴樹嘛，直接套模板咯，把之前寫的拿過來抄一遍。

提供一下我的模板。

Code

Python

class TrieNode:def __init__(self, path=0, end=0):self.end = endself.path = pathself.next_nodes = {}class Trie:def __init__(self):self.root = TrieNode()@staticmethoddef get_index(word):return [ord(ch) - ord('a') for ch in word]def insert(self, word: str) -> None:if not word:returnnode = self.rootfor idx in self.get_index(word):if idx not in node.next_nodes:node.next_nodes[idx] = TrieNode()node = node.next_nodes.get(idx)node.path += 1node.end += 1def search(self, word: str) -> bool:if not word:return Falsenode = self.rootfor idx in self.get_index(word):if idx not in node.next_nodes:return Falsenode = node.next_nodes.get(idx)return node.end != 0def delete(self, word: str) -> None:if self.search(word):node = self.rootfor idx in self.get_index(word):if node.next_node[idx].path - 1 == 0:node.next_node[idx].path -= 1node.next_node[idx] = Nonereturnnode = node.next_nodes[idx]node.end -= 1def startsWith(self, prefix: str) -> bool:if not prefix:return Falsenode = self.rootfor idx in self.get_index(prefix):if idx not in node.next_nodes:return Falsenode = node.next_nodes[idx]return node.path != 0

總結

以上是生活随笔為你收集整理的LeetCode 208. 实现 Trie (前缀树) —— 提供一套前缀树模板的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。