题目链接
题解
/**
* Definition for a binary tree node.
* class TreeNode {
* val: number
* left: TreeNode | null
* right: TreeNode | null
* constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
* }
*/
function maxProduct(root: TreeNode | null): number {
// 创建哈希表sum
let sum = new Map()
// 用于存入最大值
let ans
// 所有元素和
let n
// 递归计算每个节点作为根节点的子树的所有节点累加和
function dfs(root: TreeNode | null) {
if (!root) return 0
let s = root.val
let value = s + dfs(root.left) + dfs(root.right)
sum.set(root, value)
return value
}
/**
模拟删除每条边的情况,如果删掉的边上a->b乘积就是sum[b]*(n-sum[b]),n代表所有节点元素和,然后去乘积最大值
*/
function ndfs(root: TreeNode | null) {
let lvalue = sum.get(root.left)
let rvalue = sum.get(root.right)
if (root.left) {
ans = Math.max(ans, lvalue * (n - lvalue))
ndfs(root.left)
}
if (root.right) {
ans = Math.max(ans, rvalue * (n - rvalue))
ndfs(root.right)
}
}
dfs(root)
n = sum.get(root)
ans = 0
ndfs(root)
// 根据题意对10^9 + 7取模
return ans % 1000000007
};