- Notifications
You must be signed in to change notification settings - Fork 625
/
Copy path298.py
41 lines (34 loc) · 895 Bytes
/
298.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
'''
Given a binary tree, find the length of the longest consecutive sequence path.
The path refers to any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The longest consecutive path need to be from parent to child (cannot be the reverse).
For example,
1
\
3
/ \
2 4
\
5
Longest consecutive sequence path is 3-4-5, so return 3.
2
\
3
/
2
/
1
Longest consecutive sequence path is 2-3,not3-2-1, so return 2.
'''
classSolution(object):
defdfs(curr, parent, length):
ifnotcurr:
returnlength
ifparent:
length=length+1ifcurr.val==parent.val+1
else:
length=1
returnmax(length, max(dfs(curr.left, curr, length), dfs(curr.right, curr, length)))
deflongestConsecutive(TreeNoderoot):
ifnotroot:
return0
returndfs(root, null, 0)