leetcode 1339. Maximum Product of Splitted Binary Tree_1339 maximum product of splitted binary tree-优快云博客

本文链接：https://blog.youkuaiyun.com/weixin_42756361/article/details/107178765

本文介绍了一种算法，用于解决二叉树分裂问题，旨在寻找二叉树分裂后的两个子树，使得这两个子树节点值之和的乘积最大化。通过递归计算每个子树的节点值总和，并利用这些信息来确定最佳分裂位置。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Maximum Product of Splitted Binary Tree

/**
 * 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 {
    public int maxProduct(TreeNode root) {
        long ss = getSumRecursively(root);        
        long max=getMaxProductRecursively(root, ss);
        long m=1000000007L;

        return (int)(max%m);
    }
    
    public long getMaxProductRecursively(TreeNode root ,long ss) {
            if(root==null){
                return 0L;
            }
        
            long ls =getSumRecursively(root.left);
            long rs =getSumRecursively(root.right);
        
            long max=((ss-rs)*rs>ls*(ss-ls))?(ss-rs)*rs:ls*(ss-ls);
        
            long lMax=getMaxProductRecursively( root.left, ss);
            long rMax=getMaxProductRecursively( root.right, ss);
        
            if(max<lMax)
                max=lMax;
        
            if(max<rMax)
                max=rMax;
        
            return max;
        
    }
        
    public long getSumRecursively(TreeNode root){
        if(root==null)
            return 0L;
        
        return getSumRecursively(root.left)+getSumRecursively(root.right)+root.val;
    }
        
}