LeetCode 298. Binary Tree Longest Consecutive Sequence

最新推荐文章于 2022-01-04 14:13:32 发布

原创最新推荐文章于 2022-01-04 14:13:32 发布 · 241 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 题解同时被 2 个专栏收录

288 篇文章

订阅专栏

Multiple Passes

85 篇文章

订阅专栏

本文介绍了一种寻找二叉树中最长连续路径的方法。该路径需从父节点指向子节点，并通过递归实现。代码示例使用C++编写。

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).

using recursive is easier.

public class Solution {
    int max = 0;
 public:
 int longestConsecutive(TreeNode* root) {
        if(!root) return 0;
        helper(root,0,root.val);
        return max;
    }
 private:
     void helper(TreeNode* root,int cur, int target){
        if(root) return;
        if(root->val==target) cur++;
        else cur=1;
        max = max(cur, max);
        helper(root->left, cur, root->val+1);
        helper(root->right, cur, root->val+1);
    }
}