update some test case

Author: Cori1109

go.mod

@@ -1,5 +1,5 @@
 module awesome-golang-algorithm
 
-go 1.15
+go 1.16
 
-require github.com/stretchr/testify v1.6.1
+require github.com/stretchr/testify v1.7.0

lcof/of000/Solution_test.go

@@ -1,10 +1,11 @@
 package Solution
 
 import (
-	"github.com/stretchr/testify/assert"
 	"reflect"
 	"runtime"
 	"testing"
+
+	"github.com/stretchr/testify/assert"
 )
 
 //	solution func Info

lcof/of003/Solution_test.go

@@ -1,10 +1,11 @@
 package Solution
 
 import (
-	"github.com/stretchr/testify/assert"
 	"reflect"
 	"runtime"
 	"testing"
+
+	"github.com/stretchr/testify/assert"
 )
 
 type SolutionFuncType func([]int) int
@@ -13,6 +14,7 @@ type SolutionFuncType func([]int) int
 var SolutionFuncList = []SolutionFuncType{
 	findRepeatNumber,
 	findRepeatNumber2,
+
 	findRepeatNumber3,
 }
 

lcof/of005/Solution_test.go

@@ -1,10 +1,11 @@
 package Solution
 
 import (
-	"github.com/stretchr/testify/assert"
 	"reflect"
 	"runtime"
 	"testing"
+
+	"github.com/stretchr/testify/assert"
 )
 
 //	solution func Info

lcof/of006/Solution_test.go

@@ -1,10 +1,11 @@
 package Solution
 
 import (
-	"github.com/stretchr/testify/assert"
 	"reflect"
 	"runtime"
 	"testing"
+
+	"github.com/stretchr/testify/assert"
 )
 
 //	solution func Info

lcof/of013/README.md

@@ -0,0 +1,32 @@
+# [OF0.Template Title][title]
+
+> [!WARNING|style:flat]
+> This problem is temporarily not PR, please submit [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
+
+
+## 题目描述
+....
+
+**范例 :**
+
+```
+Input: n=1
+Output: 1
+```
+
+## 题意
+> ...
+
+## 题解
+
+### 思路1
+> ...
+```go
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

lcof/of013/Solution.go

@@ -0,0 +1,74 @@
+package Solution
+
+import "container/list"
+
+func movingCount1(m int, n int, k int) int {
+	queue := list.List{}
+	visited := make([][]bool, m)
+	for i := 0; i < len(visited); i++ {
+		visited[i] = make([]bool, n)
+	}
+	queue.PushBack([]int{0, 0, 0, 0})
+	res := 0
+	for queue.Len() > 0 {
+		back := queue.Back()
+		queue.Remove(back)
+		bfs := back.Value.([]int)
+		i := bfs[0]
+		j := bfs[1]
+		si := bfs[2]
+		sj := bfs[3]
+		if i >= m || j >= n || si+sj > k || visited[i][j] {
+			continue
+		}
+
+		res++
+		visited[i][j] = true
+
+		sj1 := sj + 1
+		si1 := si + 1
+		if (j+1)%10 == 0 {
+			sj1 = sj - 8
+		}
+		if (i+1)%10 == 0 {
+			si1 = si - 8
+		}
+
+		queue.PushBack([]int{i + 1, j, si1, sj})
+		queue.PushBack([]int{i, j + 1, si, sj1})
+	}
+	return res
+}
+
+var n1, m1, k1 int
+var visited [][]bool
+
+func movingCount2(m int, n int, k int) int {
+	m1 = m
+	n1 = n
+	k1 = k
+	visited = make([][]bool, m)
+	for i := 0; i < len(visited); i++ {
+		visited[i] = make([]bool, n)
+	}
+
+	return dfs(0, 0, 0, 0)
+}
+
+func dfs(i int, j int, si int, sj int) int {
+	if i >= m1 || j >= n1 || si+sj > k1 || visited[i][j] {
+		return 0
+	}
+	visited[i][j] = true
+
+	sj1 := sj + 1
+	si1 := si + 1
+	if (j+1)%10 == 0 {
+		sj1 = sj - 8
+	}
+	if (i+1)%10 == 0 {
+		si1 = si - 8
+	}
+
+	return 1 + dfs(i, j+1, si, sj1) + dfs(i+1, j, si1, sj)
+}

lcof/of013/Solution_test.go

@@ -0,0 +1,60 @@
+package Solution
+
+import (
+	"reflect"
+	"runtime"
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+//	solution func Info
+type SolutionFuncType func(m int, n int, k int) int
+
+var SolutionFuncList = []SolutionFuncType{
+	movingCount1,
+	movingCount2,
+}
+
+//	test info struct
+type Case struct {
+	name    string
+	input_m int
+	input_n int
+	input_k int
+	expect  int
+}
+
+// 	test case
+var cases = []Case{
+	{
+		name:    "TestCase 1",
+		input_m: 2,
+		input_n: 3,
+		input_k: 1,
+		expect:  3,
+	},
+	{
+		name:    "TestCase 2",
+		input_m: 3,
+		input_n: 1,
+		input_k: 0,
+		expect:  1,
+	},
+}
+
+// TestSolution Example for solution test cases
+func TestSolution(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, f := range SolutionFuncList {
+		for _, c := range cases {
+			t.Run(c.name, func(t *testing.T) {
+				actual := f(c.input_m, c.input_n, c.input_k)
+				ast.Equal(c.expect, actual,
+					"func: %v case: %v ",
+					runtime.FuncForPC(reflect.ValueOf(f).Pointer()).Name(), c.name)
+			})
+		}
+	}
+}