要有好消息
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
int max = 1;
public int longestConsecutive(TreeNode root) {
if (root == null) {
return 0;
}
helper(root, 1);
return max;
}
private void helper(TreeNode node, int num) {
if (node.left != null) {
if (node.val + 1 == node.left.val) {
max = Math.max(max, num + 1);
helper(node.left, num + 1);
} else {
helper(node.left, 1);
}
}
if (node.right != null) {
if (node.val + 1 == node.right.val) {
max = Math.max(max, num + 1);
helper(node.right, num + 1);
} else {
helper(node.right, 1);
}
}
}
}