测试

Author: masx200

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

@@ -1,4 +1,5 @@
-package er_cha_shu_ran_se_ugc
-func MaxValue(root *TreeNode, k int) int {
-return maxValue(root,k)
-}
+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

@@ -1,46 +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
-}
+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/maxValue_test.go

@@ -0,0 +1,21 @@
+package er_cha_shu_ran_se_ugc
+
+import (
+	"testing"
+
+	"gotest.tools/v3/assert"
+)
+import "github.com/masx200/leetcode-test/utils"
+
+var TreeNodeLeetCodeParse = utils.TreeNodeLeetCodeParse
+
+func TestMaxValue(t *testing.T) {
+	var assertEquals = func(a, b any) {
+		assert.Equal(t, a, b)
+	}
+	assertEquals(12, maxValue(TreeNodeLeetCodeParse("[5, 2, 3, 4]"), 2))
+	assertEquals(
+		16,
+		maxValue(TreeNodeLeetCodeParse("[4, 1, 3, 9, null, null, 2]"), 2),
+	)
+}

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

@@ -5,6 +5,6 @@ Deno.test("er-cha-shu-ran-se-UGC", () => {
     assertEquals(12, maxValue(TreeNodeLeetCodeFromJSON([5, 2, 3, 4]), 2));
     assertEquals(
         16,
-        maxValue(TreeNodeLeetCodeFromJSON([4, 1, 3, 9, null, null, 2]), 2)
+        maxValue(TreeNodeLeetCodeFromJSON([4, 1, 3, 9, null, null, 2]), 2),
     );
 });

utils/TreeNodeLeetCodeParse.go

@@ -1,13 +1,16 @@
 package utils
 
 import (
+	"strings"
+
 	treenode "github.com/masx200/leetcode-TreeNode-go"
 	serialize_and_deserialize_binary_tree "github.com/masx200/leetcode-test/serialize-and-deserialize-binary-tree"
 )
 
 type TreeNode = serialize_and_deserialize_binary_tree.TreeNode
 
 func TreeNodeLeetCodeParse(s string) *TreeNode {
+	s = strings.ReplaceAll(s, " ", "")
 	var t, e = treenode.NewTreeNode(s)
 	if e != nil {
 		panic(e)