【leetcode】298 Binary Tree Longest Consecutive Sequence（二叉树最长连续序列）

陆奥_

于 2022-01-04 14:13:32 发布

阅读量465

点赞数

文章标签： leetcode 深度优先算法

本文链接：https://blog.csdn.net/gengziyou/article/details/122301666

版权

这篇文章介绍了如何使用普通深度优先搜索（DFS）算法解决二叉树中寻找最长连续节点序列的问题。通过递归维护当前路径长度和全局最长长度，避免了回溯，展示了如何在遍历时快速找到最长连续序列。

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

298.Binary Tree Longest Consecutive Sequence
Given the root of a binary tree, return 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 needs to be from parent to child (cannot be the reverse).

一开始以为要用回溯，其实用普通dfs即可，在递归时维护一个变量len记录此时的连续长度，当遇到不连续的情况时从1开始重新计算。同时维护一个变量max记录递归时遇到的最长的len，最后得到的max就是答案。

var longestConsecutive = function(root) {
    const helper = (root, len, target) => {
    	//termination condition
        if(root === null) return;
        if(root.val === target) len++;
        else len = 1;
        max = Math.max(len, max);
        helper(root.left, len, root.val + 1);
        helper(root.right, len, root.val + 1);
    }
    
    //boundary condition
    if(root === null) return 0;
    //record the max length of consecutive sequence
    let max = 0;
    helper(root, 0, root.val);
    return max;
};