给定一个二叉树，找到最长的连续路径，路径中的相邻节点值差为1，路径可以向上或向下，也可以穿过节点。本文介绍了如何使用后序遍历求解此问题，通过分析节点及其子节点的递增或递减路径来找到最长连续序列。
Given the root of a binary tree, return the length of the longest consecutive path in the tree.
A consecutive path is a path where the values of the consecutive nodes in the path differ by one. This path can be either increasing or decreasing.
- For example,
[1,2,3,4]and[4,3,2,1]are both considered valid, but the path[1,2,4,3]is not valid.
On the other hand, the path can be in the child-Parent-child order, where not necessarily be parent-child order.
Example 1:
Input: root = [1,2,3] Output: 2 Explanation: The longest consecutive path is [1, 2] or [2, 1].
Example 2:
最低0.47元/天 解锁文章
扫一扫
505
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
