forked from everbird/leetcode-py
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpath-sum.py
More file actions
127 lines (92 loc) · 2.15 KB
/
path-sum.py
File metadata and controls
127 lines (92 loc) · 2.15 KB
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
#!/usr/bin/env python
# -*- coding: utf-8 -*-
class Node(object):
left = None
right = None
value = 0
def __init__(self, value, left=None, right=None):
self.value = value
self.left = left
self.right = right
stack = []
found_flag = False
def searh_path(head, path_sum):
global found_flag
pre_order(head, path_sum)
return found_flag
def pre_order(node, path_sum):
global stack
global found_flag
if not node:
return
stack.append(node.value)
if not node.left and not node.right:
if sum(stack) == path_sum:
found_flag = True
stack.pop()
return
if node.left:
pre_order(node.left, path_sum)
if node.right:
pre_order(node.right, path_sum)
stack.pop()
def run():
global stack
global found_flag
# Case 1
stack = []
found_flag = False
a = Node(7)
b = Node(2)
c = Node(11, left=a, right=b)
d = Node(4, left=c)
e = Node(13)
f = Node(1)
g = Node(4, right=f)
h = Node(8, left=e, right=g)
i = Node(5, left=d, right=h)
head = i
r = searh_path(head, 22)
assert r, 'Should be True but False'
# Case 2: {1,2}, 3
stack = []
found_flag = False
a = Node(2)
b = Node(1, left=a)
head = b
r = searh_path(head, 3)
assert r, 'Should be True but False'
# Case 3: {-2,#,-3}, -5
stack = []
found_flag = False
a = Node(-3)
b = Node(-2, right=a)
head = b
r = searh_path(head, -5)
assert r, 'Should be True but False'
# Case 4: {1,-2,3}, -1
stack = []
found_flag = False
a = Node(3)
b = Node(-2)
c = Node(1, left=b, right=a)
head = c
r = searh_path(head, -1)
assert r, 'Should be True but False'
# Case 5: {1,-2,-3,1,3,-2,#,-1}, 3
stack = []
found_flag = False
a = Node(-1)
b = Node(1, left=a)
c = Node(3)
d = Node(-2, left=b, right=c)
e = Node(-2)
f = Node(-3, left=e)
g = Node(1, left=d, right=f)
head = g
r = searh_path(head, 3)
assert not r, 'Should be False but True'
def main():
run()
if __name__ == '__main__':
main()