1080 wrong answer

Author: aQuaYi

Algorithms/1080.insufficient-nodes-in-root-to-leaf-paths/insufficient-nodes-in-root-to-leaf-paths.go

@@ -44,5 +44,15 @@ func dfs(node *TreeNode, pre, limit int) int {
 		max = r
 	}
 
+	if max == math.MinInt64 {
+		return node.Val
+	}
 	return max + node.Val
 }
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}

Algorithms/1080.insufficient-nodes-in-root-to-leaf-paths/insufficient-nodes-in-root-to-leaf-paths_test.go

@@ -14,6 +14,12 @@ var tcs = []struct {
 	ans   []int
 }{
 
+	{
+		[]int{1, 2, -3, -5, kit.NULL, 4, kit.NULL},
+		-1,
+		[]int{1, kit.NULL, -3, 4},
+	},
+
 	{
 		[]int{1, 2, 3, 4, -99, -99, 7, 8, 9, -99, -99, 12, 13, -99, 14},
 		1,
@@ -26,16 +32,10 @@ var tcs = []struct {
 		[]int{5, 4, 8, 11, kit.NULL, 17, 4, 7, kit.NULL, kit.NULL, kit.NULL, 5},
 	},
 
-	{
-		[]int{1, 2, -3, -5, kit.NULL, 4, kit.NULL},
-		-1,
-		[]int{1, kit.NULL, -3, 4},
-	},
-
 	{
 		[]int{1, 2, -3, -5, kit.NULL, 4, kit.NULL},
 		100,
-		nil,
+		[]int{},
 	},
 
 	// 可以有多个 testcase