算法的重要性,我就不多说了吧,想去大厂,就必须要经过基础知识和业务逻辑面试+算法面试。所以,为了提高大家的算法能力,这个公众号后续每天带大家做一道算法题,题目就从LeetCode上面选 !
今天和大家聊的问题叫做 二叉树中最长的连续序列,我们先来看题面:
https://leetcode-cn.com/problems/binary-tree-longest-consecutive-sequence-ii/
Given a binary tree, you need to find the length of Longest Consecutive Path in Binary Tree.
Especially, 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.
解题
https://blog.csdn.net/qq_29051413/article/details/108559688
思路:
给每一个节点搭配两个属性:inc 和 dcr 。
其中,inc 表示截至到当前节点的最长连续递增序列的长度,dcr 表示截至到当前节点的最长连续递减序列的长度。
那么,包含当前节点的连续序列路径的长度就是 inc + dec - 1。
接着找到 inc + dec - 1 值最大的节点,返回这个值即可。
class Solution {
int maxval = 0;
public int longestConsecutive(TreeNode root) {
longestPath(root);
return maxval;
}
public int[] longestPath(TreeNode root) {
if (root == null) {
return new int[]{0, 0};
}
int inr = 1, dcr = 1;
if (root.left != null) {
int[] l = longestPath(root.left);
if (root.val == root.left.val + 1) {
dcr = l[1] + 1;
} else if (root.val == root.left.val - 1) {
inr = l[0] + 1;
}
}
if (root.right != null) {
int[] r = longestPath(root.right);
if (root.val == root.right.val + 1) {
dcr = Math.max(dcr, r[1] + 1);
} else if (root.val == root.right.val - 1) {
inr = Math.max(inr, r[0] + 1);
}
}
maxval = Math.max(maxval, dcr + inr - 1);
return new int[]{inr, dcr};
}
}
好了,今天的文章就到这里,如果觉得有所收获,请顺手点个在看或者转发吧,你们的支持是我最大的动力 。
上期推文: