Commit 0394472

author

Shuo

authored

Merge pull request #735 from openset/develop

Add: Path Sum

2 parents 1326b7e + 04813ff commit 0394472Copy full SHA for 0394472

File tree

+62

-0

lines changed

+62

-0

lines changed

Lines changed: 6 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -21,6 +21,7 @@ var problemStatus = map[int]bool{`
`21`	`21`	`18: true,`
`22`	`22`	`20: true,`
`23`	`23`	`21: true,`
	`24`	`+ 22: true,`
`24`	`25`	`24: true,`
`25`	`26`	`26: true,`
`26`	`27`	`27: true,`
`@@ -45,6 +46,7 @@ var problemStatus = map[int]bool{`
`45`	`46`	`104: true,`
`46`	`47`	`108: true,`
`47`	`48`	`110: true,`
	`49`	`+ 112: true,`
`48`	`50`	`118: true,`
`49`	`51`	`119: true,`
`50`	`52`	`121: true,`
`@@ -111,6 +113,7 @@ var problemStatus = map[int]bool{`
`111`	`113`	`443: true,`
`112`	`114`	`445: true,`
`113`	`115`	`448: true,`
	`116`	`+ 455: true,`
`114`	`117`	`459: true,`
`115`	`118`	`461: true,`
`116`	`119`	`468: true,`
`@@ -174,6 +177,7 @@ var problemStatus = map[int]bool{`
`174`	`177`	`896: true,`
`175`	`178`	`905: true,`
`176`	`179`	`908: true,`
	`180`	`+ 912: true,`
`177`	`181`	`914: true,`
`178`	`182`	`917: true,`
`179`	`183`	`922: true,`
`@@ -218,9 +222,11 @@ var problemStatus = map[int]bool{`
`218`	`222`	`1046: true,`
`219`	`223`	`1047: true,`
`220`	`224`	`1051: true,`
	`225`	`+ 1071: true,`
`221`	`226`	`1108: true,`
`222`	`227`	`1154: true,`
`223`	`228`	`1163: true,`
	`229`	`+ 1170: true,`
`224`	`230`	`1185: true,`
`225`	`231`	`1189: true,`
`226`	`232`	`1221: true,`

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1 +1,24 @@`
`1`	`1`	`package problem112`
	`2`	`+`
	`3`	`+import "github.com/openset/leetcode/internal/kit"`
	`4`	`+`
	`5`	`+// TreeNode - Definition for a binary tree node.`
	`6`	`+type TreeNode = kit.TreeNode`
	`7`	`+`
	`8`	`+/**`
	`9`	`+ * Definition for a binary tree node.`
	`10`	`+ * type TreeNode struct {`
	`11`	`+ * Val int`
	`12`	`+ * Left *TreeNode`
	`13`	`+ * Right *TreeNode`
	`14`	`+ * }`
	`15`	`+ */`
	`16`	`+func hasPathSum(root *TreeNode, sum int) bool {`
	`17`	`+ if root == nil {`
	`18`	`+ return false`
	`19`	`+ }`
	`20`	`+ if root.Left == nil && root.Right == nil {`
	`21`	`+ return root.Val == sum`
	`22`	`+ }`
	`23`	`+ return hasPathSum(root.Left, sum-root.Val) \|\| hasPathSum(root.Right, sum-root.Val)`
	`24`	`+}`

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1 +1,34 @@`
`1`	`1`	`package problem112`
	`2`	`+`
	`3`	`+import (`
	`4`	`+ "testing"`
	`5`	`+`
	`6`	`+ "github.com/openset/leetcode/internal/kit"`
	`7`	`+)`
	`8`	`+`
	`9`	`+type testType struct {`
	`10`	`+ in []int`
	`11`	`+ sum int`
	`12`	`+ want bool`
	`13`	`+}`
	`14`	`+`
	`15`	`+func TestHasPathSum(t *testing.T) {`
	`16`	`+ tests := [...]testType{`
	`17`	`+ {`
	`18`	`+ in: []int{5, 4, 8, 11, kit.NULL, 13, 4, 7, 2, kit.NULL, kit.NULL, kit.NULL, 1},`
	`19`	`+ sum: 22,`
	`20`	`+ want: true,`
	`21`	`+ },`
	`22`	`+ {`
	`23`	`+ in: []int{5, 8, 4, 4, 13, kit.NULL, 11, 7, 2},`
	`24`	`+ sum: 22,`
	`25`	`+ want: false,`
	`26`	`+ },`
	`27`	`+ }`
	`28`	`+ for _, tt := range tests {`
	`29`	`+ got := hasPathSum(kit.SliceInt2TreeNode(tt.in), tt.sum)`
	`30`	`+ if got != tt.want {`
	`31`	`+ t.Fatalf("in: %v, got: %v, want: %v", tt.in, got, tt.want)`
	`32`	`+ }`
	`33`	`+ }`
	`34`	`+}`

Comments

(0)