-
Notifications
You must be signed in to change notification settings - Fork 0
/
Tree.py
67 lines (49 loc) · 1.35 KB
/
Tree.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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
from typing import List, Dict
from sortedcollections import SortedDict
from numba import *
class Node:
children: SortedDict
leaf: bool
def __init__(self):
self.children = SortedDict()
self.leaf = True
node_type = deferred_type()
spec = [
('root', node_type),
('wh', node_type[:, :]),
('n', int32)
]
#@jitclass(spec)
class Tree:
def __init__(self, n: int):
self.root = Node()
self.wh = [[] for i in range(1 + n)]
self.n = n
def add_nodes(self, I: List[int]):
t = self.root
for u in I:
nxt = t.children.get(u)
if nxt is None:
c_node = Node()
self.wh[u].append(c_node)
t.children[u] = c_node
t.leaf = False
t = t.children[u]
def has(self, I: List[int]):
if len(I) == 0:
return True
for t in self.wh[I[0]]:
if self._has(I, t, 1):
return True
return False
def _has(self, I: List[int], t: Node, k: int):
if k == len(I):
return True
for u in t.children:
if u > I[k]:
return False
if u == I[k]:
return self._has(I, t.children[u], k + 1)
if self._has(I, t.children[u], k):
return True
return False