forked from neetcode-gh/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
208-Implement-Trie.py
49 lines (43 loc) · 1.25 KB
/
208-Implement-Trie.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
class TrieNode:
def __init__(self):
self.children = [None] * 26
self.end = False
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.
"""
curr = self.root
for c in word:
i = ord(c)-ord("a")
if curr.children[i] == None:
curr.children[i] = TrieNode()
curr = curr.children[i]
curr.end = True
def search(self, word: str) -> bool:
"""
Returns if the word is in the trie.
"""
curr = self.root
for c in word:
i = ord(c)-ord("a")
if curr.children[i] == None:
return False
curr = curr.children[i]
return curr.end
def startsWith(self, prefix: str) -> bool:
"""
Returns if there is any word in the trie that starts with the given prefix.
"""
curr = self.root
for c in prefix:
i = ord(c)-ord("a")
if curr.children[i] == None:
return False
curr = curr.children[i]
return True