-
Notifications
You must be signed in to change notification settings - Fork 0
/
BTLongestConsecutiveSequence.java
53 lines (47 loc) · 1.1 KB
/
BTLongestConsecutiveSequence.java
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
/*
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.
*/
class BTLongestConsecutiveSequence {
int max = 0;
public int longestConsecutive(TreeNode root) {
if(root == null) {
return 0;
}
dfs(root, 0, root.val);
return max;
}
private void dfs(TreeNode root, int curr, int target) {
if(root == null) {
return;
}
if(root.val == target) {
curr++;
}
else {
curr = 1;
}
max = Math.max(max, curr);
dfs(root.left, curr, root.val + 1);
dfs(root.right, curr, root.val + 1);
}
}