add some solution for offer

Author: Cori1109

nowcoder/jz-offer/jz006/README.md renamed to lcof/of011/README.md

@@ -1,4 +1,4 @@
-# [JZ6.旋转数组的最小数字][title]
+# [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)
@@ -28,5 +28,5 @@ Output: 1
 
 如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
 
-[title]: https://www.nowcoder.com/practice/9f3231a991af4f55b95579b44b7a01ba/
+[title]: https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3/
 [me]: https://github.com/kylesliu/awesome-golang-algorithm

nowcoder/jz-offer/jz006/Solution.go renamed to lcof/of011/Solution.go

@@ -1,7 +1,6 @@
 package Solution
 
-//	二分查找
-func minNumberInRotateArray(arr []int) int {
+func minArray(arr []int) int {
 	if len(arr) == 0 {
 		return 0
 	}

lcof/of011/Solution_test.go

@@ -0,0 +1,62 @@
+package Solution
+
+import (
+	"github.com/stretchr/testify/assert"
+	"reflect"
+	"runtime"
+	"testing"
+)
+
+//	solution func Info
+type SolutionFuncType func([]int) int
+
+var SolutionFuncList = []SolutionFuncType{
+	minArray,
+}
+
+//	test info struct
+type Case struct {
+	name   string
+	inputs []int
+	expect int
+}
+
+// 	test case
+var cases = []Case{
+	{
+		name:   "TestCase 1",
+		inputs: []int{3, 4, 5, 1, 2},
+		expect: 1,
+	},
+	{
+		name:   "TestCase 2",
+		inputs: []int{2, 2, 2, 0, 1},
+		expect: 0,
+	},
+	{
+		name:   "TestCase 3",
+		inputs: []int{},
+		expect: 0,
+	},
+	{
+		name:   "TestCase 4",
+		inputs: []int{6501, 6828, 6963, 7036, 7422, 7674, 8146, 8468, 8704, 8717, 9170, 9359, 9719, 9895, 9896, 9913, 9962, 154, 293, 334, 492, 1323, 1479, 1539, 1727, 1870, 1943, 2383, 2392, 2996, 3282, 3812, 3903, 4465, 4605, 4665, 4772, 4828, 5142, 5437, 5448, 5668, 5706, 5725, 6300, 6335},
+		expect: 154,
+	},
+}
+
+// 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.inputs)
+				ast.Equal(c.expect, actual,
+					"func: %v case: %v ",
+					runtime.FuncForPC(reflect.ValueOf(f).Pointer()).Name(), c.name)
+			})
+		}
+	}
+}

lcof/of012/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/of012/Solution.go

@@ -0,0 +1,45 @@
+package Solution
+
+func exist(board [][]byte, word string) bool {
+	m, n := len(board), len(board[0])
+	for i := 0; i < m; i++ {
+		for j := 0; j < n; j++ {
+			//如果在数组中找得到第一个数，就执行下一步，否则返回false
+			if search(board, i, j, 0, word) {
+				return true
+			}
+		}
+	}
+	return false
+}
+func search(board [][]byte, i, j, k int, word string) bool {
+	//如果找到最后一个数，则返回true,搜索成功
+	if k == len(word) {
+		return true
+	}
+	//i,j的约束条件
+	if i < 0 || j < 0 || i == len(board) || j == len(board[0]) {
+		return false
+	}
+
+	//进入DFS深度优先搜索
+	//先把正在遍历的该值重新赋值，如果在该值的周围都搜索不到目标字符，则再把该值还原
+	//如果在数组中找到第一个字符，则进入下一个字符的查找
+	if board[i][j] == word[k] {
+		temp := board[i][j]
+		board[i][j] = ' '
+		//下面这个if语句，如果成功进入，说明找到该字符，然后进行下一个字符的搜索,直到所有的搜索都成功，
+		//即k == len(word) - 1 的大小时，会返回true，进入该条件语句，然后返回函数true值。
+		if search(board, i, j+1, k+1, word) ||
+			search(board, i, j-1, k+1, word) ||
+			search(board, i+1, j, k+1, word) ||
+			search(board, i-1, j, k+1, word) {
+			return true
+		} else {
+			//没有找到目标字符，还原之前重新赋值的board[i][j]
+			board[i][j] = temp
+		}
+	}
+
+	return false
+}

lcof/of012/Solution_test.go

@@ -0,0 +1,62 @@
+package Solution
+
+import (
+	"github.com/stretchr/testify/assert"
+	"reflect"
+	"runtime"
+	"testing"
+)
+
+//	solution func Info
+type SolutionFuncType func([][]byte, string) bool
+
+var SolutionFuncList = []SolutionFuncType{
+	exist,
+}
+
+//	test info struct
+type Case struct {
+	name   string
+	board  [][]byte
+	word   string
+	expect bool
+}
+
+// 	test case
+var cases = []Case{
+	{
+		name: "TestCase 1",
+		board: [][]byte{
+			[]byte{'A', 'B', 'C', 'E'},
+			[]byte{'S', 'F', 'C', 'S'},
+			[]byte{'A', 'D', 'E', 'E'},
+		},
+		word:   "ABCCED",
+		expect: true,
+	},
+	{
+		name: "TestCase 2",
+		board: [][]byte{
+			[]byte{'a', 'b'},
+			[]byte{'c', 'd'},
+		},
+		word:   "abcd",
+		expect: false,
+	},
+}
+
+// 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.board, c.word)
+				ast.Equal(c.expect, actual,
+					"func: %v case: %v ",
+					runtime.FuncForPC(reflect.ValueOf(f).Pointer()).Name(), c.name)
+			})
+		}
+	}
+}