feat:

Author: plh97

algorithm/450.DeleteNodeaBST/main_test.go

@@ -13,16 +13,36 @@ var tcs = []struct {
 	N2  int
 	ans *TreeNode
 }{
-	// {
-	// 	Helper.Ints2TreeNode([]int{5, 3, 6, 2, 4, -1 << 63, 7}),
-	// 	3,
-	// 	Helper.Ints2TreeNode([]int{5, 2, 6, -1 << 63, 4, -1 << 63, 7}),
-	// },
+	{
+		Helper.Ints2TreeNode([]int{5, 3, 6, 2, 4, -1 << 63, 7}),
+		3,
+		Helper.Ints2TreeNode([]int{5, 4, 6, 2, -1 << 63, -1 << 63, 7}),
+	},
 	{
 		Helper.Ints2TreeNode([]int{0}),
 		0,
 		Helper.Ints2TreeNode([]int{}),
 	},
+	{
+		Helper.Ints2TreeNode([]int{}),
+		0,
+		Helper.Ints2TreeNode([]int{}),
+	},
+	{
+		Helper.Ints2TreeNode([]int{1, -1 << 63, 2}),
+		2,
+		Helper.Ints2TreeNode([]int{1}),
+	},
+	{
+		Helper.Ints2TreeNode([]int{2, 1}),
+		2,
+		Helper.Ints2TreeNode([]int{1}),
+	},
+	{
+		Helper.Ints2TreeNode([]int{1, -1 << 63, 2}),
+		2,
+		Helper.Ints2TreeNode([]int{1}),
+	},
 	{
 		Helper.Ints2TreeNode([]int{1, -1 << 63, 2}),
 		1,

algorithm/55.JumpGame/main.go

@@ -2,7 +2,7 @@ package canJump
 
 func canJump(nums []int) bool {
 	res := helper(nums)
-	return res < 3
+	return res < 9999
 }
 
 func helper(nums []int) int {
@@ -22,6 +22,9 @@ func helper(nums []int) int {
 }
 
 func min(nums []int) int {
+	if len(nums) == 0 {
+		return 99999
+	}
 	res := nums[0]
 	for _, e := range nums {
 		if res > e {

algorithm/55.JumpGame/main_test.go

@@ -14,6 +14,18 @@ var tcs = []struct {
 		[]int{2, 3, 1, 1, 4},
 		true,
 	},
+	{
+		[]int{3, 2, 1, 0, 4},
+		false,
+	},
+	{
+		[]int{2},
+		true,
+	},
+	{
+		[]int{1, 1, 2, 2, 0, 1, 1},
+		true,
+	},
 }
 
 func Test_bitwiseComplement(t *testing.T) {