- Depth-first Search
LeetCode - Medium - 1026. Maximum Difference Between Node and Ancestor
Given the root
of a binary tree, find the maximum value V
for which there exist different nodes A
and B
where V = |A.val - B.val|
and A
is an ancestor of B
.
A node A
is an ancestor of B
if either: any child of A
is equal to B
, or any child of A
is an ancestor of B
.
Example 1:
Input: root = [8,3,10,1,6,null,14,null,null,4,7,13]
Output: 7
Explanation: We have various ancestor-node differences, some of which are given below :
|8 - 3| = 5
|3 - 7| = 4
|8 - 1| = 7
|10 - 13| = 3
Among all possible differences, the maximum value of 7 is obtained by |8 - 1| = 7.
Example 2:
Input: root = [1,null,2,null,0,3]
Output: 3
Constraints:
-
The number of nodes in the tree is in the range [2, 5000].
-
0 < = N o d e . v a l < = 1 0 5 0 <= Node.val <= 10^5 0<=Node.val<=105
遍历从根节点到叶子节点的路径中,找出最大值和最小值,便得到这路径的最大差值,以此类推,从各个从根节点到叶子节点的路径的最大差值中求出最大值。
方法一:我自己写的,后序遍历模式。
方法二:我自己写的,前序遍历模式。
方法三:别人写的,后序遍历模式,更精明简要。
import com.lun.util.BinaryTree.TreeNode;
public class MaximumDifferenceBetweenNodeAndAncestor {
//方法一:我自己写的,后序遍历模式
public int maxAncestorDiff(TreeNode root) {
return maxAncestorDiff(root, Integer.MIN_VALUE, Integer.MAX_VALUE);
}
private int maxAncestorDiff(TreeNode node, int max, int min) {
max = Math.max(max, node.val);
min = Math.min(min, node.val);
int maxDiff = max - min;
int maxDiffFromLeft = Integer.MIN_VALUE;
if(node.left != null) {
maxDiffFromLeft = maxAncestorDiff(node.left, max, min);
}
int maxDiffFromRight = Integer.MIN_VALUE;
if(node.right != null) {
maxDiffFromRight = maxAncestorDiff(node.right, max, min);
}
return Math.max(Math.max(maxDiffFromLeft, maxDiffFromRight), maxDiff);
}
//方法二:我自己写的,前序遍历模式
public int maxAncestorDiff2(TreeNode root) {
int[] maxDiff = {Integer.MIN_VALUE};
maxAncestorDiff2(root, Integer.MIN_VALUE, Integer.MAX_VALUE, maxDiff);
return maxDiff[0];
}
private void maxAncestorDiff2(TreeNode node, int max, int min, int[] maxDiff) {
if(node == null) return;
max = Math.max(max, node.val);
min = Math.min(min, node.val);
maxDiff[0] = Math.max(maxDiff[0], max - min);
maxAncestorDiff2(node.left, max, min, maxDiff);
maxAncestorDiff2(node.right, max, min, maxDiff);
}
//方法三:别人写的,后序遍历模式,更精明简要
public int maxAncestorDiff3(TreeNode root) {
return dfs(root, root.val, root.val);
}
public int dfs(TreeNode root, int mn, int mx) {
if (root == null) return mx - mn;
mx = Math.max(mx, root.val);
最后
自我介绍一下,小编13年上海交大毕业,曾经在小公司待过,也去过华为、OPPO等大厂,18年进入阿里一直到现在。
深知大多数初中级Android工程师,想要提升技能,往往是自己摸索成长,自己不成体系的自学效果低效漫长且无助。
因此收集整理了一份《2024年Web前端开发全套学习资料》,初衷也很简单,就是希望能够帮助到想自学提升又不知道该从何学起的朋友,同时减轻大家的负担。
既有适合小白学习的零基础资料,也有适合3年以上经验的小伙伴深入学习提升的进阶课程,基本涵盖了95%以上Android开发知识点!不论你是刚入门Android开发的新手,还是希望在技术上不断提升的资深开发者,这些资料都将为你打开新的学习之门!
如果你觉得这些内容对你有帮助,需要这份全套学习资料的朋友可以戳我获取!!
由于文件比较大,这里只是将部分目录截图出来,每个节点里面都包含大厂面经、学习笔记、源码讲义、实战项目、讲解视频,并且会持续更新!
涵盖了95%以上Android开发知识点!不论你是刚入门Android开发的新手,还是希望在技术上不断提升的资深开发者,这些资料都将为你打开新的学习之门!**
如果你觉得这些内容对你有帮助,需要这份全套学习资料的朋友可以戳我获取!!
由于文件比较大,这里只是将部分目录截图出来,每个节点里面都包含大厂面经、学习笔记、源码讲义、实战项目、讲解视频,并且会持续更新!