437 wrong answer

Author: aQua

Algorithms/0437.path-sum-iii/path-sum-iii.go

@@ -3,10 +3,23 @@ package Problem0437
 import (
 	"github.com/aQuaYi/LeetCode-in-Golang/kit"
 )
+
 type TreeNode = kit.TreeNode
 
 func pathSum(root *TreeNode, sum int) int {
-res :=0
+	res := 0
+	if root == nil {
+		return res
+	}
+
+	newSum := sum - root.Val
+	if newSum == 0 {
+		res++
+		return 1 + pathSum(root.Left, sum) + pathSum(root.Right, sum)
+	}
 
-	return res 
+	return pathSum(root.Left, sum) +
+		pathSum(root.Right, sum) +
+		pathSum(root.Left, newSum) +
+		pathSum(root.Right, newSum)
 }

Algorithms/0437.path-sum-iii/path-sum-iii_test.go

@@ -20,10 +20,10 @@ func Test_Problem0437(t *testing.T) {
 	}{
 
 		{
-			[]int{10, 5, 3, 3, -2, 2, 1, -3, 11},
-			[]int{3, 3, -2, 5, 2, 1, 10, -3, 11},
+			[]int{8, 5, 3, 5, -2, 2, 1, -3, 11},
+			[]int{5, 3, -2, 5, 2, 1, 8, -3, 11},
 			8,
-			3,
+			5,
 		},
 
 		// 可以多个 testcase