LeetCode 题解(281) ：Binary Tree Longest Consecutive Sequence

最新推荐文章于 2025-04-21 22:09:55 发布

原创最新推荐文章于 2025-04-21 22:09:55 发布 · 547 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#algorithm #leetcode #面试题

算法专栏收录该内容

318 篇文章

订阅专栏

本文介绍了一个使用递归方法解决寻找二叉树中连续序列最长路径的问题。详细解释了算法实现过程，并提供了C++和Java两种语言的代码实现。

摘要生成于 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.

题解：

递归。思路很直观。

C++版：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxL = 0;
    
    int longestConsecutive(TreeNode* root) {
        if(root == NULL)
            return 0;
        int l = longest(root);
        return max(l, maxL);
    }
    
    int longest(TreeNode* root) {
        if(root->left == NULL && root->right == NULL) {
            if(maxL == 0)
                maxL = 1;
            return 1;
        }
        int l = 1;
        if(root->left != NULL) {
            int ret = longest(root->left);
            if(ret > maxL)
                maxL = ret;
            if(root->val + 1 == root->left->val)
                l = max(l, ret + 1);
        }
        if(root->right != NULL) {
            int ret = longest(root->right);
            if(ret > maxL)
                maxL = ret;
            if(root->val + 1 == root->right->val)
                l = max(l, ret + 1);
        }
        return l;
    }
};

Java版：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int maxL = 0;
    
    public int longestConsecutive(TreeNode root) {
        if(root == null)
            return 0;
        int l = longest(root);
        return Math.max(l, maxL);
    }
    
    private int longest(TreeNode root) {
        if(root.left == null && root.right == null) {
            if(maxL == 0)
                maxL = 1;
            return 1;
        }
        int l = 1;
        if(root.left != null) {
            int ret = longest(root.left);
            if(ret > maxL)
                maxL = ret;
            if(root.val + 1 == root.left.val)
                l = Math.max(l, ret + 1);
        }
        if(root.right != null) {
            int ret = longest(root.right);
            if(ret > maxL)
                maxL = ret;
            if(root.val + 1 == root.right.val)
                l = Math.max(l, ret + 1);
        }
        return l;
    }
}