更正路径

Author: halfrost

Algorithms/0055. Jump Game/55. Jump Game.go renamed to Algorithms/0055.Jump-Game/55. Jump Game.go

@@ -17,3 +17,10 @@ func canJump(nums []int) bool {
 	}
 	return true
 }
+
+func max(a int, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}

Algorithms/0055. Jump Game/55. Jump Game_test.go renamed to Algorithms/0055.Jump-Game/55. Jump Game_test.go

@@ -1,5 +1,12 @@
 package leetcode
 
+import (
+	"github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
 /**
  * Definition for a binary tree node.
  * type TreeNode struct {
@@ -25,3 +32,10 @@ func dfsTreeRob(root *TreeNode) (a, b int) {
 	tmp1 := root.Val + l0 + r0
 	return tmp0, tmp1
 }
+
+func max(a int, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}

Algorithms/0055. Jump Game/README.md renamed to Algorithms/0055.Jump-Game/README.md

@@ -3,6 +3,8 @@ package leetcode
 import (
 	"fmt"
 	"testing"
+
+	"github.com/halfrost/LeetCode-Go/structures"
 )
 
 type question337 struct {
@@ -27,7 +29,7 @@ func Test_Problem337(t *testing.T) {
 	qs := []question337{
 
 		question337{
-			para337{[]int{3, 2, 3, NULL, 3, NULL, 1}},
+			para337{[]int{3, 2, 3, structures.NULL, 3, structures.NULL, 1}},
 			ans337{7},
 		},
 
@@ -37,7 +39,7 @@ func Test_Problem337(t *testing.T) {
 		},
 
 		question337{
-			para337{[]int{3, 4, 5, 1, 3, NULL, 1}},
+			para337{[]int{3, 4, 5, 1, 3, structures.NULL, 1}},
 			ans337{9},
 		},
 	}
@@ -46,7 +48,7 @@ func Test_Problem337(t *testing.T) {
 
 	for _, q := range qs {
 		_, p := q.ans337, q.para337
-		fmt.Printf("【input】:%v       【output】:%v\n", p, rob337(Ints2TreeNode(p.one)))
+		fmt.Printf("【input】:%v       【output】:%v\n", p, rob337(structures.Ints2TreeNode(p.one)))
 	}
 	fmt.Printf("\n\n\n")
 }

Algorithms/0337. House Robber III/337. House Robber III.go renamed to Algorithms/0337.House-Robber-III/337. House Robber III.go

@@ -39,6 +39,10 @@ func updateBoard(board [][]byte, click []int) [][]byte {
 	return board
 }
 
+func isInBoard(board [][]byte, x, y int) bool {
+	return x >= 0 && x < len(board) && y >= 0 && y < len(board[0])
+}
+
 func mineSweeper(x, y int, board [][]byte, mineMap [][]int, dir8 [][]int) {
 	if board[x][y] != 'M' && board[x][y] != 'E' {
 		return