Maximum Product of Splitted Binary Tree

-
Three simple concepts in this problem, here is the problem: https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/

1343. Maximum Product of Splitted Binary Tree
Medium
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].
It can be solved in O(n)-time and O(1)-space, using the following concepts:

  1. Utilization of Post-Order Traversal (SetValSumNodes)
  2. Reusing the node val to store the sum of all the elements for that sub-tree
  3. BigInteger computation (Numerics library) followed by the mod 10^9 + 7
Notice that due to #2, you can compute the current product in constant time (current product: (root.val - currentNode.left.val) * currentNode.left.val). Code is below, cheers, ACC.


public class Solution
{
    public int MaxProduct(TreeNode root)
    {
        if (root == null) return 0;

        BigInteger val = -1;
        SetValSumNodes(root);
        MaxProduct(root, root.val, ref val);
        return (int)(val % 1000000007);
    }

    private void MaxProduct(TreeNode node,
                            int sumAllNodes,
                            ref BigInteger prod)
    {
        if (node == null || (node.left == null && node.right == null)) return;
        if (node.left != null)
        {
            BigInteger current = (BigInteger)(sumAllNodes - node.left.val) * node.left.val;
            prod = BigInteger.Max(prod, current);
        }
        if (node.right != null)
        {
            BigInteger current = (BigInteger)(sumAllNodes - node.right.val) * node.right.val;
            prod = BigInteger.Max(prod, current);
        }
        MaxProduct(node.left, sumAllNodes, ref prod);
        MaxProduct(node.right, sumAllNodes, ref prod);
    }

    private void SetValSumNodes(TreeNode node)
    {
        if (node == null) return;
        SetValSumNodes(node.left);
        SetValSumNodes(node.right);
        if (node.left != null) node.val += node.left.val;
        if (node.right != null) node.val += node.right.val;
    }
}

Comments

Post a Comment

Popular posts from this blog

Count Binary Substrings

-
Image
Problem by Leetcode:  https://leetcode.com/problems/count-binary-substrings/description/ Give a string  s , count the number of non-empty (contiguous) substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively. Substrings that occur multiple times are counted the number of times they occur. Example 1: Input: "00110011" Output: 6 Explanation: There are 6 substrings that have equal number of consecutive 1's and 0's: "0011", "01", "1100", "10", "0011", and "01". Notice that some of these substrings repeat and are counted the number of times they occur. Also, "00110011" is not a valid substring because all the 0's (and 1's) are not grouped together. Example 2: Input: "10101" Output: 4 Explanation: There are 4 substrings: "10", "01", "10", "01&
Read more

Count Vowels Permutation: Standard DP

-
Image
Standard DP problem:  https://leetcode.com/problems/count-vowels-permutation/ Given an integer  n , your task is to count how many strings of length  n  can be formed under the following rules: Each character is a lower case vowel ( 'a' ,  'e' ,  'i' ,  'o' ,  'u' ) Each vowel  'a'  may only be followed by an  'e' . Each vowel  'e'  may only be followed by an  'a'  or an  'i' . Each vowel  'i'   may not  be followed by another  'i' . Each vowel  'o'  may only be followed by an  'i'  or a  'u' . Each vowel  'u'  may only be followed by an  'a'. Since the answer may be too large, return it modulo  10^9 + 7. Example 1: Input: n = 1 Output: 5 Explanation: All possible strings are: "a", "e", "i" , "o" and "u". Example 2: Input: n = 2 Output: 10 Explanation: All possible strings are
Read more

Maximum Number of Balloons

-
Image
#431 in my solved list:  https://leetcode.com/problems/maximum-number-of-balloons/ Given a string  text , you want to use the characters of  text  to form as many instances of the word  "balloon"  as possible. You can use each character in  text   at most once . Return the maximum number of instances that can be formed.   Example 1: Input: text = "nlaebolko" Output: 1 Example 2: Input: text = "loonbalxballpoon" Output: 2 Example 3: Input: text = "leetcode" Output: 0 Constraints: 1 <= text.length <= 10^4 text  consists of lower case English letters only. Solution is as follows:  - Count the number of occurrences of the "balloon" letters in the input string  - For "l" and "o", divide the count by 2  - If the balloon string is not fully covered, return 0  - Return the min number across all occurrences Code is below, cheers, ACC. public class Solution {     public int M
Read more