题目:
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 <= Node.val <= 105
题解:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
private static int result;
public int maxAncestorDiff(TreeNode root) {
if(root == null) return 0;
result = Integer.MIN_VALUE;
dfs(root, root.val, root.val);
return result;
}
public void dfs(TreeNode node, int max, int min){
if(node == null) return;
max = Math.max(max, node.val);
min = Math.min(min, node.val);
result = Math.max(result, max - min);
dfs(node.left, max, min);
dfs(node.right, max, min);
}
}
思路:
不断地更新最大与最小的节点值,由于递归的特性,获取的最小值与最大值都是祖辈节点的值。不断更新最大的结果值。