add some solution for offer

Author: Cori1109

README.md

@@ -46,6 +46,7 @@ LeetCode of algorithms with golang solution(updating:smiley:).
 - [LeetCode-in-Go](https://github.com/aQuaYi/LeetCode-in-Go) 某位算法大佬的Golang题解
 - [ACWING](https://www.acwing.com/) 一些算法竞赛大佬创建的平台，挺适合入门的。
 - [剑指Offer](https://www.nowcoder.com/ta/coding-interviews) 一些算法竞赛大佬创建的平台，挺适合入门的。
+- [剑指Offer](https://leetcode-cn.com/problemset/lcof/) 一些算法竞赛大佬创建的平台，挺适合入门的。
 
 ## Contributors
 

go.mod

@@ -1,4 +1,4 @@
-module github.com/kylesliu/awesome-golang-leetcode
+module github.com/kylesliu/awesome-golang-algorithm
 
 go 1.15
 

lcof/of000/Solution_test.go

@@ -30,7 +30,7 @@ var cases = []Case{
 	},
 	{
 		name:   "TestCase 2",
-		inputs: true,
+		inputs: false,
 		expect: false,
 	},
 }

nowcoder/jz-offer/jz003/README.md renamed to lcof/of003/README.md

@@ -1,4 +1,4 @@
-# [JZ0.Template Title][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)

lcof/of003/Solution.go

@@ -0,0 +1,43 @@
+package Solution
+
+import "sort"
+
+//	排序 + 遍历
+func findRepeatNumber(nums []int) int {
+	sort.Ints(nums)
+	for idx, _ := range nums {
+		if idx > 0 {
+			if nums[idx] == nums[idx-1] {
+				return nums[idx]
+			}
+		}
+	}
+	return 0
+}
+
+//	map哈希表
+func findRepeatNumber2(nums []int) int {
+	mapTmp := make(map[int]bool)
+	for _, val := range nums {
+		if mapTmp[val] {
+			return val
+		} else {
+			mapTmp[val] = true
+		}
+	}
+	return 0
+}
+
+//	原地置换
+func findRepeatNumber3(nums []int) int {
+	for idx, val := range nums {
+		if idx == val {
+			continue
+		}
+		if nums[val] == val {
+			return val
+		}
+		nums[val], nums[idx] = nums[idx], nums[val]
+	}
+	return 0
+}

lcof/of003/Solution_test.go

@@ -0,0 +1,60 @@
+package Solution
+
+import (
+	"github.com/stretchr/testify/assert"
+	"reflect"
+	"runtime"
+	"testing"
+)
+
+type SolutionFuncType func([]int) int
+
+//	Solution func
+var SolutionFuncList = []SolutionFuncType{
+	findRepeatNumber,
+	findRepeatNumber2,
+	findRepeatNumber3,
+}
+
+// test  info struct
+type Case struct {
+	name   string
+	inputs []int
+	expect int
+}
+
+// test case
+var cases = []Case{
+	{
+		name:   "TestCase 1",
+		inputs: []int{},
+		expect: 0,
+	},
+	{
+		name:   "TestCase 2",
+		inputs: []int{2, 1, 1, 0, 2, 5, 3},
+		expect: 1,
+	},
+	{
+		name:   "TestCase 2",
+		inputs: []int{1, 1, 0, 2, 5, 3},
+		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.inputs)
+				ast.Equal(c.expect, actual,
+					"func: %v case: %v ",
+					runtime.FuncForPC(reflect.ValueOf(f).Pointer()).Name(), c.name)
+			})
+		}
+	}
+
+}

nowcoder/jz-offer/jz008/README.md renamed to lcof/of004/README.md

@@ -1,4 +1,4 @@
-# [JZ0.跳台阶][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/8c82a5b80378478f9484d87d1c5f12a4/
+[title]: https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3/
 [me]: https://github.com/kylesliu/awesome-golang-algorithm

nowcoder/jz-offer/jz001/Solution.go renamed to lcof/of004/Solution.go

@@ -1,11 +1,11 @@
 package Solution
 
-func Find(board [][]int, target int) bool {
-	rlen := len(board)
-	clen := len(board[0])
+func findNumberIn2DArray(board [][]int, target int) bool {
+	rLen := len(board)
+	cLen := len(board[0])
 
 	//	从右上角的元素找起来
-	for r, c := 0, clen-1; r < rlen && c >= 0; {
+	for r, c := 0, cLen-1; r < rLen && c >= 0; {
 		if board[r][c] == target {
 			return true
 		}

lcof/of004/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) bool
+
+var SolutionFuncList = []SolutionFuncType{
+	findNumberIn2DArray,
+}
+
+//	test info struct
+type Case struct {
+	name   string
+	board  [][]int
+	target int
+	expect bool
+}
+
+// 	test case
+var cases = []Case{
+	{
+		name: "TestCase 1",
+		board: [][]int{
+			[]int{1, 2, 8, 9},
+		},
+		target: 7,
+		expect: false,
+	},
+	{
+		name: "TestCase 2",
+		board: [][]int{
+			[]int{1, 2, 8, 9},
+			[]int{2, 4, 9, 12},
+			[]int{4, 7, 10, 13},
+			[]int{6, 8, 11, 15},
+		},
+		target: 7,
+		expect: true,
+	},
+}
+
+// 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.target)
+				ast.Equal(c.expect, actual,
+					"func: %v case: %v ",
+					runtime.FuncForPC(reflect.ValueOf(f).Pointer()).Name(), c.name)
+			})
+		}
+	}
+}

nowcoder/jz-offer/jz002/README.md renamed to lcof/of005/README.md

@@ -1,4 +1,4 @@
-# [JZ0.替换空格][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/4060ac7e3e404ad1a894ef3e17650423/
+[title]: https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3/
 [me]: https://github.com/kylesliu/awesome-golang-algorithm

lcof/of005/Solution.go

@@ -0,0 +1,19 @@
+package Solution
+
+func replaceSpace(s string) string {
+	result := make([]rune, len(s)*3)
+
+	i := 0
+	for _, v := range s {
+		if v != ' ' {
+			result[i] = v
+			i++
+		} else {
+			result[i] = '%'
+			result[i+1] = '2'
+			result[i+2] = '0'
+			i += 3
+		}
+	}
+	return string(result)[:i]
+}

lcof/of005/Solution_test.go

@@ -0,0 +1,47 @@
+package Solution
+
+import (
+	"github.com/stretchr/testify/assert"
+	"reflect"
+	"runtime"
+	"testing"
+)
+
+//	solution func Info
+type SolutionFuncType func(string) string
+
+var SolutionFuncList = []SolutionFuncType{
+	replaceSpace,
+}
+
+//	test info struct
+type Case struct {
+	name   string
+	inputs string
+	expect string
+}
+
+// 	test case
+var cases = []Case{
+	{
+		name:   "TestCase 1",
+		inputs: "We are happy.",
+		expect: "We%20are%20happy.",
+	},
+}
+
+// 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)
+			})
+		}
+	}
+}

nowcoder/jz-offer/jz004/README.md renamed to lcof/of006/README.md

@@ -1,4 +1,4 @@
-# [JZ4.重建二叉树][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/8a19cbe657394eeaac2f6ea9b0f6fcf6
+[title]: https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3/
 [me]: https://github.com/kylesliu/awesome-golang-algorithm

nowcoder/jz-offer/jz003/Solution.go renamed to lcof/of006/Solution.go

@@ -1,38 +1,34 @@
 package Solution
 
-type NodeList struct {
+type ListNode struct {
 	Val  int
-	Next *NodeList
+	Next *ListNode
 }
 
 //	递归写法
-func printListFromTailToHead(head *NodeList) []int {
+func printListFromTailToHead(head *ListNode) []int {
 	ans := make([]int, 0)
 	if head == nil {
 		return ans
 	}
 	ans = printListFromTailToHead(head.Next)
 	ans = append(ans, head.Val)
-
 	return ans
 }
 
 //	反转琏表
-func printListFromTailToHead2(head *NodeList) []int {
-	pre, cur, next, ans := &NodeList{}, head, head.Next, []int{}
-
+func printListFromTailToHead2(head *ListNode) []int {
+	pre, cur, next, ans := &ListNode{}, head, head.Next, []int{}
 	for cur != nil {
 		next = cur.Next
 		cur.Next = pre
 
 		pre = cur
 		cur = next
 	}
-
 	for pre.Next != nil {
 		ans = append(ans, pre.Val)
 		pre = pre.Next
 	}
-
 	return ans
 }