给你一棵指定的二叉树的根节点 root ,请你计算其中 最长连续序列路径 的长度。
最长连续序列路径 是依次递增 1 的路径。该路径,可以是从某个初始节点到树中任意节点,通过「父 - 子」关系连接而产生的任意路径。且必须从父节点到子节点,反过来是不可以的。
示例 1:
输入:root = [1,null,3,2,4,null,null,null,5]
输出:3
解释:当中,最长连续序列是 3-4-5 ,所以返回结果为 3 。
示例 2:
输入:root = [2,null,3,2,null,1]
输出:2
解释:当中,最长连续序列是 2-3 。注意,不是 3-2-1,所以返回 2 。
#include <iostream>
#include<algorithm>
using namespace std;
struct TreeNode
{
int val;
TreeNode* left;
TreeNode* right;
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
};
class Solution
{
public:
int longestConsecutive(TreeNode* root)
{
if (!root)
return 0;
int maxLen = 0;;
dfs(root, nullptr, 0, maxLen);
return maxLen;
}
private:
void dfs(TreeNode* node,TreeNode* parent,int currLen,int& maxLen)
{
if (!node)
return;
if (parent && node->val == parent->val + 1)
{
currLen++;
}
else
{
currLen = 1;
}
maxLen = max(maxLen, currLen);
dfs(node->left, node, currLen, maxLen);
dfs(node->right, node, currLen, maxLen);
}
};
int main()
{
TreeNode* root = new TreeNode(1);
root->right = new TreeNode(3);
root->right->left = new TreeNode(2);
root->right->right = new TreeNode(4);
root->right->right->right = new TreeNode(5);
Solution solution;
int result = solution.longestConsecutive(root);
std::cout << "最长连续序列路径的长度是: " << result << std::endl;
delete root->right->right->right;
delete root->right->right;
delete root->right->left;
delete root->right;
delete root;
return 0;
}
题目来源:LeetCode100题