1026. Maximum Difference Between Node and Ancestor

最新推荐文章于 2021-12-31 10:04:03 发布

m1f2c3

最新推荐文章于 2021-12-31 10:04:03 发布

阅读量117

点赞数

分类专栏： LeetCode 文章标签： a

本文链接：https://blog.csdn.net/m1f2c3/article/details/97305379

版权

LeetCode 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

在这里插入图片描述

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public int maxAncestorDiff(TreeNode root) {
        if(root == null){
            return 0;
        }else{
            int[] max = {Integer.MIN_VALUE};
            int[] res = maxAncestorDiffCore(root, max);
            return max[0];
        }
    }
    
    public int[] maxAncestorDiffCore(TreeNode root, int[] max) {
        if(root.left != null && root.right != null){
            int[] range_l = maxAncestorDiffCore(root.left, max);
            int[] range_r = maxAncestorDiffCore(root.right, max);
            int[] range_cur = {Math.min(range_l[0], range_r[0]), Math.max(range_l[1], range_r[1])};
            int temp_max = Math.max(Math.abs(root.val - range_cur[0]), Math.abs(root.val - range_cur[1]));
            max[0] = Math.max(temp_max, max[0]);
            range_cur[0] = Math.min(range_cur[0], root.val);
            range_cur[1] = Math.max(range_cur[1], root.val);
            return range_cur;
        }else if(root.left != null){
            int[] range_l = maxAncestorDiffCore(root.left, max);
            int[] range_cur = {range_l[0], range_l[1]};
            int temp_max = Math.max(Math.abs(root.val - range_cur[0]), Math.abs(root.val - range_cur[1]));
            max[0] = Math.max(temp_max, max[0]);
            range_cur[0] = Math.min(range_cur[0], root.val);
            range_cur[1] = Math.max(range_cur[1], root.val);
            return range_cur;
        }else if(root.right != null){
            int[] range_r = maxAncestorDiffCore(root.right, max);
            int[] range_cur = {range_r[0], range_r[1]};
            int temp_max = Math.max(Math.abs(root.val - range_cur[0]), Math.abs(root.val - range_cur[1]));
            max[0] = Math.max(temp_max, max[0]);
            range_cur[0] = Math.min(range_cur[0], root.val);
            range_cur[1] = Math.max(range_cur[1], root.val);
            return range_cur;
        }else{
            return new int[]{root.val, root.val};
        }

    }
}