題目

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

題解

樹形 dp，思路見草稿

/*** 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 total = subTreeSum(root, 0); // target可以是任意值，此處只是想拿返回的totalsubTreeSum(root, total);return (int) ((result * (total - result)) % 1000000007L);}long result;public long subTreeSum(TreeNode node, long target) {if (node == null) return 0;long res = node.val + subTreeSum(node.left, target) + subTreeSum(node.right, target);if (Math.abs(res * 2 - target) < Math.abs(result * 2 - target)) result = res;return res;} }

總結

以上是生活随笔為你收集整理的leetcode 1339. Maximum Product of Splitted Binary Tree | 1339. 分裂二叉树的最大乘积（树形dp）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。