549. Binary Tree Longest Consecutive Sequence II

最新推荐文章于 2020-11-23 10:18:10 发布

zshouyi

最新推荐文章于 2020-11-23 10:18:10 发布

阅读量376

点赞数

分类专栏： LeetCode Tree 文章标签： LeetCode Tree Binary Tree Longest

本文链接：https://blog.csdn.net/zshouyi/article/details/72852037

版权

LeetCode 同时被 2 个专栏收录

402 篇文章 0 订阅

订阅专栏

Tree

55 篇文章 0 订阅

订阅专栏

Given a binary tree, you need to find the length of Longest Consecutive Path in Binary Tree.

Especially, this path can be either increasing or decreasing. For example, [1,2,3,4] and [4,3,2,1] are both considered valid, but the path [1,2,4,3] is not valid. On the other hand, the path can be in the child-Parent-child order, where not necessarily be parent-child order.

Example 1:

Input:
        1
       / \
      2   3
Output: 2
Explanation: The longest consecutive path is [1, 2] or [2, 1].

Example 2:

Input:
        2
       / \
      1   3
Output: 3
Explanation: The longest consecutive path is [1, 2, 3] or [3, 2, 1].

Note: All the values of tree nodes are in the range of [-1e7, 1e7].

这个比I麻烦在可以是child-Parent-child的顺序。那么需要判断左边的inc和dec，右边的inc和dec，比较左inc+右dec和左dec+右inc的大小，取最大。设全局max，递归的过程中实时更新max。代码如下：

/**
 * 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 = 0;
    
    public int longestConsecutive(TreeNode root) {
        if (root == null) {
            return 0;
        }
        helper(root);
        return max;
    }
    
    private int[] helper(TreeNode root) {
        if (root == null) {
            return new int[]{0, 0};
        } 
        int inc = 1, dec = 1;
        if (root.left != null) {
            int[] l = helper(root.left);
            if (root.val == root.left.val + 1) {
                inc = l[0] + 1;
            } else if (root.val == root.left.val - 1) {
                dec = l[1] + 1;
            }
        }
        if (root.right != null) {
            int[] r = helper(root.right);
            if (root.val == root.right.val + 1) {
                inc = Math.max(inc, r[0] + 1);
            } else if (root.val == root.right.val - 1) {
                dec = Math.max(dec, r[1] + 1);
            }
        }
        max = Math.max(max, inc + dec - 1);
        return new int[]{inc, dec};
    }
}