LeetCode - Binary Tree Longest Consecutive Sequence
Posted IncredibleThings
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode - 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). For example, 1 3 / 2 4 5 Longest consecutive sequence path is 3-4-5, so return 3. 2 3 / 2 / 1 Longest consecutive sequence path is 2-3,not3-2-1, so return 2.
Recursion:
时间O(n) 空间O(h)
因为要找最长的连续路径,我们在遍历树的时候需要两个信息,一是目前连起来的路径有多长,二是目前路径的上一个节点的值。我们通过递归把这些信息代入,然后通过返回值返回一个最大的就行了。
public int longestConsecutive(TreeNode root) { if(root == null){ return 0; } return findLongestConsecutivePath(root, 0, root.val-1); } public int findLongestConsecutivePath(TreeNode root, int length, int preVal){ if(root == null){ return 0; } if(preVal == root.val - 1){ length++; } else{ length = 1; } return Math.max(length, Math.max(findLongestConsecutivePath(root.left, length, root.val),findLongestConsecutivePath(root.right, length, root.val))); }
以上是关于LeetCode - Binary Tree Longest Consecutive Sequence的主要内容,如果未能解决你的问题,请参考以下文章
[Leetcode] Binary tree-- 606. Construct String from Binary Tree
[Leetcode] Binary search tree --Binary Search Tree Iterator
Leetcode[110]-Balanced Binary Tree
[Leetcode] Binary tree -- 501. Find Mode in Binary Search Tree
[Lintcode]95. Validate Binary Search Tree/[Leetcode]98. Validate Binary Search Tree