commit 112/118

Author: Forge Yao

112/112-hasPathSum.go

@@ -0,0 +1,28 @@
+// https://leetcode-cn.com/problems/path-sum/
+package main
+
+import (
+	"fmt"
+	"leetcode/util"
+)
+
+type TreeNode = util.TreeNode
+
+func hasPathSum(root *TreeNode, targetSum int) bool {
+	if root == nil {
+		return false
+	}
+	if root.Left == nil && root.Right == nil {
+		return root.Val == targetSum
+	}
+
+	return (hasPathSum(root.Left, targetSum-root.Val) || hasPathSum(root.Right, targetSum-root.Val))
+}
+
+func main() {
+	n := [][]int{{5, 4, 8, 11, 0, 13, 4, 7, 2, 0, 0, 0, 1}, {1, 2, 3}, {1, 2}}
+	target := []int{22, 5, 0}
+	for i := 0; i < len(n) && i < len(target); i++ {
+		fmt.Println("ret:", hasPathSum(util.CreateTree(n[i]), target[i]))
+	}
+}

118/118-generate.go

@@ -0,0 +1,26 @@
+// https://leetcode-cn.com/problems/pascals-triangle/
+package main
+
+import "fmt"
+
+func generate(numRows int) [][]int {
+	num := make([][]int, numRows)
+	for i := 0; i < numRows; i++ {
+		num[i] = make([]int, i+1)
+		for j := 0; j <= i; j++ {
+			if j == 0 || j == i {
+				num[i][j] = 1
+			} else {
+				num[i][j] = num[i-1][j-1] + num[i-1][j]
+			}
+		}
+	}
+	return num
+}
+
+func main() {
+	n := []int{5, 7}
+	for i := 0; i < len(n); i++ {
+		fmt.Println("ret:", generate(n[i]))
+	}
+}

README.md

@@ -33,6 +33,8 @@ LeetCode
 |108|[将有序数组转换为二叉搜索树](https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree/)|[Go](./108/108-sortedArrayToBST.go)|简单|二叉搜索树|
 |110|[平衡二叉树](https://leetcode-cn.com/problems/balanced-binary-tree/)|[Go](./110/110-isBalanced.go)|简单|二叉树|
 |111|[二叉树的最小深度](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/)|[Go](./111/111-minDepth.go)|简单|二叉树|
+|112|[路径总和](https://leetcode-cn.com/problems/path-sum/)|[Go](./112/112-hasPathSum.go)|简单|二叉树|
+|118|[杨辉三角](https://leetcode-cn.com/problems/pascals-triangle/)|[Go](./118/118-generate.go)|简单||
 |125|[验证回文串](https://leetcode-cn.com/problems/valid-palindrome/)|[Go](./125-isPalindrome/125-isPalindrome.go)|简单||
 |131|[分割回文串](https://leetcode-cn.com/problems/palindrome-partitioning/) | [Go](./131-partition/131-partition.go)|中等|递归, 动态规划|
 |141|[环形链表](https://leetcode-cn.com/problems/linked-list-cycle/)|[Go](./141-hasCycle/141-hasCycle.go)|简单|双指针|