1339. Maximum Product of Splitted Binary Tree

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

Given a binary tree root. Split the binary tree into two subtrees by removing 1 edge such that the product of the sums of the subtrees are maximized.

Since the answer may be too large, return it modulo 10^9 + 7.

Example 1:

Input: root = [1,2,3,4,5,6]
Output: 110
Explanation: Remove the red edge and get 2 binary trees with sum 11 and 10. Their product is 110 (11*10)
Example 2:

Input: root = [1,null,2,3,4,null,null,5,6]
Output: 90
Explanation: Remove the red edge and get 2 binary trees with sum 15 and 6.Their product is 90 (15*6)
Example 3:

Input: root = [2,3,9,10,7,8,6,5,4,11,1]
Output: 1025
Example 4:

Input: root = [1,1]
Output: 1

Constraints:

Each tree has at most 50000 nodes and at least 2 nodes.
Each node’s value is between [1, 10000].

思路：所有结点的和一定，差越小，积越大，所以就找一种差最小的切割方式。用一遍递归计算以每个结点为根的子树和（技巧：引用传参，保存中间结果），记为i，总和记为tot，选择其中$|tot-2i|$最小的，记为mindif，最终结果是$(to{t}^2-mindi{f}^2)/4\%mod$。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int mod=1e9+7;
    typedef long long ll;
    int computesum(TreeNode* root, vector<int>& subsum){
        if(root==NULL){
            return 0;
        }
        int sum=computesum(root->left,subsum)+computesum(root->right,subsum)+root->val;
        subsum.push_back(sum);
        return sum;
    }
    
    int maxProduct(TreeNode* root) {
        vector<int> subsum;
        int tot=computesum(root,subsum);
        int mindif=tot;
        for(int i:subsum){
            mindif=min(mindif,abs(tot-2*i));
        }
        int ans=((ll)tot*tot-(ll)mindif*mindif)/4%mod;
        return ans;
    }
};