LeetCode 1339. 分裂二叉树的最大乘积

最新推荐文章于 2024-06-07 15:46:49 发布

qq789045

最新推荐文章于 2024-06-07 15:46:49 发布

阅读量285

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq789045/article/details/105342195

版权

LeetCode 专栏收录该内容

99 篇文章 0 订阅

订阅专栏

https://leetcode-cn.com/problems/maximum-product-of-splitted-binary-tree/

这道题关键是求出所有节点的和，每一个子树的和，两个相减就是另一半的和。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

struct Node{
    int val;
    Node *left;
    Node *right;
    long long sum;
    Node(int x):val(x),left(NULL),right(NULL),sum(0){}
};

class Solution {
public:
    long long all_sum;
    
    Node* build(TreeNode * root){
        if(root==NULL){
            return NULL;
        }
        Node* root2=new Node(root->val);
        root2->sum=root2->val;
        root2->left=build(root->left);
        if(root2->left!=NULL)
            root2->sum+=root2->left->sum;
        root2->right=build(root->right);
        if(root2->right!=NULL)
            root2->sum+=root2->right->sum;
        return root2;
    }
    
    long long cal(Node *root){
        if(root==NULL)
            return -1;
        long long ans=-1;
        
        if(root->left){
            ans=root->left->sum * (all_sum - root->left->sum);
        }
        if(root->right){
            ans=max(ans,root->right->sum * (all_sum - root->right->sum));
        }
        
        ans=max(ans,cal(root->left));
        ans=max(ans,cal(root->right));
        return ans;
        
    }
    
    int maxProduct(TreeNode* root) {
        Node *root2=build(root);
        all_sum=root2->sum;
        return cal(root2)%1000000007;
    }
};