更正路径

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

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

@@ -1,5 +1,12 @@
 package leetcode
 
+var dir = [][]int{
+	[]int{-1, 0},
+	[]int{0, 1},
+	[]int{1, 0},
+	[]int{0, -1},
+}
+
 func maxAreaOfIsland(grid [][]int) int {
 	res := 0
 	for i, row := range grid {
@@ -16,6 +23,10 @@ func maxAreaOfIsland(grid [][]int) int {
 	return res
 }
 
+func isInGrid(grid [][]int, x, y int) bool {
+	return x >= 0 && x < len(grid) && y >= 0 && y < len(grid[0])
+}
+
 func areaOfIsland(grid [][]int, x, y int) int {
 	if !isInGrid(grid, x, y) || grid[x][y] == 0 {
 		return 0

Algorithms/0337. House Robber III/README.md renamed to Algorithms/0337.House-Robber-III/README.md

@@ -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 {

Algorithms/0494. Target Sum/494. Target Sum.go renamed to Algorithms/0494.Target-Sum/494. Target Sum.go

@@ -3,6 +3,8 @@ package leetcode
 import (
 	"fmt"
 	"testing"
+
+	"github.com/halfrost/LeetCode-Go/structures"
 )
 
 type question863 struct {
@@ -29,7 +31,7 @@ func Test_Problem863(t *testing.T) {
 	qs := []question863{
 
 		question863{
-			para863{[]int{3, 5, 1, 6, 2, 0, 8, NULL, NULL, 7, 4}, []int{5}, 2},
+			para863{[]int{3, 5, 1, 6, 2, 0, 8, structures.NULL, structures.NULL, 7, 4}, []int{5}, 2},
 			ans863{[]int{7, 4, 1}},
 		},
 	}
@@ -38,7 +40,7 @@ func Test_Problem863(t *testing.T) {
 
 	for _, q := range qs {
 		_, p := q.ans863, q.para863
-		tree, target := Ints2TreeNode(p.root), Ints2TreeNode(p.target)
+		tree, target := structures.Ints2TreeNode(p.root), structures.Ints2TreeNode(p.target)
 		fmt.Printf("【input】:%v       【output】:%v\n", p, distanceK(tree, target, p.K))
 	}
 	fmt.Printf("\n\n\n")

Algorithms/0494. Target Sum/494. Target Sum_test.go renamed to Algorithms/0494.Target-Sum/494. Target Sum_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 {

Algorithms/0494. Target Sum/README.md renamed to Algorithms/0494.Target-Sum/README.md

@@ -3,6 +3,8 @@ package leetcode
 import (
 	"fmt"
 	"testing"
+
+	"github.com/halfrost/LeetCode-Go/structures"
 )
 
 type question872 struct {
@@ -37,8 +39,8 @@ func Test_Problem872(t *testing.T) {
 
 	for _, q := range qs {
 		_, p := q.ans872, q.para872
-		tree1 := Ints2TreeNode(p.one)
-		tree2 := Ints2TreeNode(p.two)
+		tree1 := structures.Ints2TreeNode(p.one)
+		tree2 := structures.Ints2TreeNode(p.two)
 		fmt.Printf("【input】:%v       【output】:%v\n", p, leafSimilar(tree1, tree2))
 	}
 	fmt.Printf("\n\n\n")

Algorithms/0529. Minesweeper/529. Minesweeper.go renamed to Algorithms/0529.Minesweeper/529. Minesweeper.go

@@ -1,5 +1,12 @@
 package leetcode
 
+var dir = [][]int{
+	[]int{-1, 0},
+	[]int{0, 1},
+	[]int{1, 0},
+	[]int{0, -1},
+}
+
 func numEnclaves(A [][]int) int {
 	m, n := len(A), len(A[0])
 	for i := 0; i < m; i++ {
@@ -33,3 +40,7 @@ func dfsNumEnclaves(A [][]int, x, y int) {
 		dfsNumEnclaves(A, nx, ny)
 	}
 }
+
+func isInGrid(grid [][]int, x, y int) bool {
+	return x >= 0 && x < len(grid) && y >= 0 && y < len(grid[0])
+}

Algorithms/0529. Minesweeper/529. Minesweeper_test.go renamed to Algorithms/0529.Minesweeper/529. Minesweeper_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 {
@@ -31,3 +38,24 @@ func dfsAncestorDiff(root *TreeNode, res *int) (int, int) {
 	*res = max(*res, max(abs(root.Val-min(leftMin, rightMin)), abs(root.Val-max(leftMax, rightMax))))
 	return max(leftMax, max(rightMax, root.Val)), min(leftMin, min(rightMin, root.Val))
 }
+
+func max(a int, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func min(a int, b int) int {
+	if a > b {
+		return b
+	}
+	return a
+}
+
+func abs(a int) int {
+	if a > 0 {
+		return a
+	}
+	return -a
+}

Algorithms/0529. Minesweeper/README.md renamed to Algorithms/0529.Minesweeper/README.md

@@ -3,6 +3,8 @@ package leetcode
 import (
 	"fmt"
 	"testing"
+
+	"github.com/halfrost/LeetCode-Go/structures"
 )
 
 type question1026 struct {
@@ -32,7 +34,7 @@ func Test_Problem1026(t *testing.T) {
 		},
 
 		question1026{
-			para1026{[]int{8, 3, 10, 1, 6, NULL, 14, NULL, NULL, 4, 7, 13}},
+			para1026{[]int{8, 3, 10, 1, 6, structures.NULL, 14, structures.NULL, structures.NULL, 4, 7, 13}},
 			ans1026{7},
 		},
 
@@ -51,7 +53,7 @@ func Test_Problem1026(t *testing.T) {
 
 	for _, q := range qs {
 		_, p := q.ans1026, q.para1026
-		tree := Ints2TreeNode(p.one)
+		tree := structures.Ints2TreeNode(p.one)
 		fmt.Printf("【input】:%v       【output】:%v\n", p, maxAncestorDiff(tree))
 	}
 	fmt.Printf("\n\n\n")

Algorithms/0638. Shopping Offers/638. Shopping Offers.go renamed to Algorithms/0638.Shopping-Offers/638. Shopping Offers.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 {

Algorithms/0638. Shopping Offers/638. Shopping Offers_test.go renamed to Algorithms/0638.Shopping-Offers/638. Shopping Offers_test.go

@@ -3,6 +3,8 @@ package leetcode
 import (
 	"fmt"
 	"testing"
+
+	"github.com/halfrost/LeetCode-Go/structures"
 )
 
 type question1110 struct {
@@ -29,15 +31,15 @@ func Test_Problem1110(t *testing.T) {
 
 		question1110{
 			para1110{[]int{1, 2, 3, 4, 5, 6, 7}, []int{3, 5}},
-			ans1110{[][]int{[]int{1, 2, NULL, 4}, []int{6}, []int{7}}},
+			ans1110{[][]int{[]int{1, 2, structures.NULL, 4}, []int{6}, []int{7}}},
 		},
 	}
 
 	fmt.Printf("------------------------Leetcode Problem 1110------------------------\n")
 
 	for _, q := range qs {
 		_, p := q.ans1110, q.para1110
-		tree := Ints2TreeNode(p.one)
+		tree := structures.Ints2TreeNode(p.one)
 		fmt.Printf("【input】:%v       【output】:%v\n", p, delNodes(tree, p.two))
 	}
 	fmt.Printf("\n\n\n")

Algorithms/0638. Shopping Offers/README.md renamed to Algorithms/0638.Shopping-Offers/README.md

@@ -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 {
@@ -8,6 +15,7 @@ package leetcode
  *     Right *TreeNode
  * }
  */
+
 func btreeGameWinningMove(root *TreeNode, n int, x int) bool {
 	var left, right int
 	dfsBtreeGameWinningMove(root, &left, &right, x)

Algorithms/0695. Max Area of Island/695. Max Area of Island.go renamed to Algorithms/0695.Max-Area-of-Island/695. Max Area of Island.go

@@ -3,6 +3,8 @@ package leetcode
 import (
 	"fmt"
 	"testing"
+
+	"github.com/halfrost/LeetCode-Go/structures"
 )
 
 type question1145 struct {
@@ -13,33 +15,33 @@ type question1145 struct {
 // para 是参数
 // one 代表第一个参数
 type para1145 struct {
-	root   []int
-	target []int
-	K      int
+	root []int
+	n    int
+	x    int
 }
 
 // ans 是答案
 // one 代表第一个答案
 type ans1145 struct {
-	one []int
+	one bool
 }
 
 func Test_Problem1145(t *testing.T) {
 
 	qs := []question1145{
 
 		question1145{
-			para1145{[]int{3, 5, 1, 6, 2, 0, 8, NULL, NULL, 7, 4}, []int{5}, 2},
-			ans1145{[]int{7, 4, 1}},
+			para1145{[]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}, 11, 3},
+			ans1145{true},
 		},
 	}
 
 	fmt.Printf("------------------------Leetcode Problem 1145------------------------\n")
 
 	for _, q := range qs {
 		_, p := q.ans1145, q.para1145
-		tree, target := Ints2TreeNode(p.root), Ints2TreeNode(p.target)
-		fmt.Printf("【input】:%v       【output】:%v\n", p, distanceK(tree, target, p.K))
+		tree := structures.Ints2TreeNode(p.root)
+		fmt.Printf("【input】:%v       【output】:%v\n", p, btreeGameWinningMove(tree, p.n, p.x))
 	}
 	fmt.Printf("\n\n\n")
 }

Algorithms/0695. Max Area of Island/695. Max Area of Island_test.go renamed to Algorithms/0695.Max-Area-of-Island/695. Max Area of Island_test.go

@@ -22,3 +22,10 @@ func balancedString(s string) int {
 	}
 	return res
 }
+
+func min(a int, b int) int {
+	if a > b {
+		return b
+	}
+	return a
+}