Maximum Difference Between Node and Ancestor（C++节点与其祖先之间的最大差值）

最新推荐文章于 2024-09-18 11:04:20 发布

coolsunxu

最新推荐文章于 2024-09-18 11:04:20 发布

阅读量87

点赞数

分类专栏： C++ LeetCode 文章标签： leetcode dfs 二叉树 c++ 递归

本文链接：https://blog.csdn.net/coolsunxu/article/details/112463411

版权

C++ 同时被 2 个专栏收录

735 篇文章 18 订阅

订阅专栏

LeetCode

459 篇文章 1 订阅

订阅专栏

解题思路：

（1）保存每个子树中的节点最大值和最小值

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
    
public:
    vector<int> dfs(TreeNode *root,int &maxs) {
        if(root==NULL) return {-1,-1};
        vector<int> l=dfs(root->left,maxs);
        vector<int> r=dfs(root->right,maxs);
        
        if(l[0]==-1 && r[0]==-1) return {root->val,root->val};
        else if(l[0]==-1) {
            int root_min = min(r[0],root->val);
            int root_max = max(r[1],root->val);
            int temp = max(abs(root->val-r[0]),abs(root->val-r[1]));

            if(temp>maxs) maxs=temp;
            return {root_min,root_max};
        } else if(r[0]==-1) {
            int root_min = min(l[0],root->val);
            int root_max = max(l[1],root->val);
            int temp = max(abs(root->val-l[0]),abs(root->val-l[1]));

            if(temp>maxs) maxs=temp;
            return {root_min,root_max};
        } else {
            int root_min = min(min(l[0],r[0]),root->val);
            int root_max = max(max(l[1],r[1]),root->val);
            int temp = max(max(max(abs(root->val-l[0]),abs(root->val-l[1])),abs(root->val-r[0])),abs(root->val-r[1]));

            if(temp>maxs) maxs=temp;
            return {root_min,root_max};
        }
    }
    
    int maxAncestorDiff(TreeNode* root) {
        int maxs = 0;
        dfs(root,maxs);
        return maxs;
    }
};