298 Binary Tree Longest Consecutive Sequence

最新推荐文章于 2020-12-05 14:44:06 发布

原创最新推荐文章于 2020-12-05 14:44:06 发布 · 264 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 同时被 2 个专栏收录

146 篇文章

订阅专栏

Google

21 篇文章

订阅专栏

本文介绍了一种解决二叉树中最长连续序列路径问题的方法。通过递归先序遍历，检查每个节点与其父节点的关系，以确定最长连续路径。最长连续路径必须从父节点指向子节点。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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,

Longest consecutive sequence path is 3-4-5, so return 3.

Longest consecutive sequence path is 2-3,not3-2-1, so return 2.

这道题让我们求二叉树的最长连续序列，关于二叉树的题基本都需要遍历树，而递归遍历写起来特别简单，下面这种解法是用到了递归版的先序遍历，我们对于每个遍历到的节点，我们看节点值是否比参数值(父节点值)大1，如果是则长度加1，否则长度重置为1，然后更新结果res，再递归调用左右子节点即可

public class LongestConsecutive {
    public int longestConsecutive(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int res = 0;
        dfs(root, root.val, 0, res);
        return res;
    }
    
    private void dfs(TreeNode root, int v, int out, int res) {
        if (root == null) {
            return;
        }
        if (root.val == v + 1) {
            out++;
        } else {
            out = 1;
        }
        res = Math.max(res, out);
        
        dfs(root.left, root.val, out, res);
        dfs(root.right, root.val, out, res);
    }
}