-
Notifications
You must be signed in to change notification settings - Fork 0
/
trie.py
53 lines (48 loc) · 1.61 KB
/
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
50
51
52
53
class Node:
def __init__(self, val = None, isEnd = False):
self.val = val
self.children = dict()
self.isEnd = isEnd
class Trie:
def __init__(self):
self.root = Node(None, False)
def insert(self, string):
cur = self.root
for i in range(len(string)):
char = string[i]
if i < len(string) - 1:
if char in cur.children:
cur = cur.children[char]
else:
cur.children[char] = Node(char, False)
cur = cur.children[char]
else:
if char in cur.children:
newnode = Node(True)
cur = cur.children[char]
cur.children[''] = Node('', True)
else:
cur.children[char] = Node(char, False)
cur = cur.children[char]
cur.children[''] = Node('', True)
def search(self, string):
cur = self.root
for i in range(len(string)):
char = string[i]
if char not in cur.children:
return False
cur = cur.children[char]
if i >= len(string) - 1:
if '' in cur.children:
return True
else:
return False
return False
def startsWith(self, string):
cur = self.root
for i in range(len(string)):
char = string[i]
if char not in cur.children:
return False
cur = cur.children[char]
return True