[LC] 298. Binary Tree Longest Consecutive Sequence
Posted xuanlu
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LC] 298. Binary Tree Longest Consecutive Sequence相关的知识,希望对你有一定的参考价值。
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).
Example 1:
Input: 1 3 / 2 4 5 Output:3
Explanation: Longest consecutive sequence path is3-4-5
, so return3
.
Example 2:
Input: 2 3 / 2 / 1 Output: 2 Explanation: Longest consecutive sequence path is2-3
, not3-2-1
, so return2
.
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ class Solution { int res = 0; public int longestConsecutive(TreeNode root) { if (root == null) { return res; } helper(root, root.val, 0); return res; } private void helper(TreeNode root, int num, int cur) { if (root == null) { return; } if (root.val == num + 1) { cur += 1; } else { cur = 1; } res = Math.max(res, cur); helper(root.left, root.val, cur); helper(root.right, root.val, cur); } }
以上是关于[LC] 298. Binary Tree Longest Consecutive Sequence的主要内容,如果未能解决你的问题,请参考以下文章
298. Binary Tree Longest Consecutive Sequence
298. Binary Tree Longest Consecutive Sequence
298.Binary Tree Longest Consecutive Sequence