목록208. Implement Trie (Prefix Tree) (1)

Scribbling

LeetCode: 208. Implement Trie (Prefix Tree)

class TrieNode: def __init__(self): self.children = {} self.endFlag = False class Trie: def __init__(self): self.root = TrieNode() def insert(self, word: str) -> None: node = self.root for char in word: if char not in node.children: node.children[char] = TrieNode() node = node.children[char] node.endFlag = True def search(self, word: str) -> bool: node = self.root for char in word: if char not i..
Computer Science/Coding Test 2021. 12. 9. 17:10
이전 Prev 1 Next 다음