package er_cha_shu_ran_se_ugc

Author: masx200

er-cha-shu-ran-se-UGC/export.go

@@ -0,0 +1,4 @@
+package er_cha_shu_ran_se_ugc
+func MaxValue(root *TreeNode, k int) int {
+return maxValue(root,k)
+}

er-cha-shu-ran-se-UGC/index.go

@@ -0,0 +1,46 @@
+package er_cha_shu_ran_se_ugc
+
+import (
+	"math"
+
+	sadbt "github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree"
+)
+
+type TreeNode = sadbt.TreeNode
+
+func maxValue(root *TreeNode, k int) int {
+	return Max(dfs(root, k)...)
+}
+
+func dfs(root *TreeNode, k int) []int {
+	ans := make([]int, k+1)
+	if root == nil {
+		return ans
+	}
+
+	left := dfs(root.Left, k)
+	right := dfs(root.Right, k)
+	for i := range ans {
+		ans[i] = left[k] + right[k]
+	}
+
+	for i := 1; i <= k; i++ {
+		temp := math.MinInt
+		for j := 0; j <= i-1; j++ {
+			temp = Max(temp, left[j]+right[i-1-j])
+		}
+		ans[i] = Max(ans[i], temp+root.Val)
+	}
+	return ans
+}
+func Max(values ...int) int {
+
+	value := math.MinInt
+
+	for _, v := range values {
+		if value < v {
+			value = v
+		}
+	}
+	return value
+}

er-cha-shu-ran-se-UGC/index.ts

@@ -1,9 +1,9 @@
 import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
-function maxValue(root: TreeNode | null, k: number) {
+function maxValue(root: TreeNode | null, k: number): number {
     return Math.max(...dfs(root, k));
 }
-function dfs(root: TreeNode | null, k: number) {
-    const ans = Array(k + 1).fill(0);
+function dfs(root: TreeNode | null, k: number): number[] {
+    const ans = Array<number>(k + 1).fill(0);
     if (!root) return ans;
 
     const left = dfs(root.left, k);