Merge pull request #175 from kylesliu/develop

add some solution

Author: Kyle Liu

lcof/of006/Solution.go

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

lcof/of006/Solution_test.go

@@ -11,8 +11,8 @@ import (
 type SolutionFuncType func(node *ListNode) []int
 
 var SolutionFuncList = []SolutionFuncType{
-	printListFromTailToHead,
-	printListFromTailToHead2,
+	reversePrint,
+	reversePrint2,
 }
 
 //	test info struct
@@ -25,7 +25,12 @@ type Case struct {
 // 	test case
 var cases = []Case{
 	{
-		name: "TestCase 1",
+		name:   "TestCase 1",
+		inputs: nil,
+		expect: []int{},
+	},
+	{
+		name: "TestCase 2",
 		inputs: &ListNode{Val: 1,
 			Next: &ListNode{Val: 2, Next: &ListNode{Val: 3}}},
 		expect: []int{3, 2, 1},

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

@@ -0,0 +1,21 @@
+package Solution
+
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}
+
+func deleteNode(head *ListNode, val int) *ListNode {
+	if head == nil {
+		return nil
+	} else if head.Val == val {
+		return head.Next
+	}
+
+	ans := head
+	for head.Next.Val != val {
+		head = head.Next
+	}
+	head.Next = head.Next.Next
+	return ans
+}

lcof/of018/Solution_test.go

@@ -0,0 +1,61 @@
+package Solution
+
+import (
+	"github.com/stretchr/testify/assert"
+	"reflect"
+	"runtime"
+	"testing"
+)
+
+//	solution func Info
+type SolutionFuncType func(*ListNode, int) *ListNode
+
+var SolutionFuncList = []SolutionFuncType{
+	deleteNode,
+}
+
+//	test info struct
+type Case struct {
+	name   string
+	inputs *ListNode
+	val    int
+	expect *ListNode
+}
+
+// 	test case
+var cases = []Case{
+	{
+		name:   "TestCase 1",
+		inputs: &ListNode{Val: 4, Next: &ListNode{Val: 5, Next: &ListNode{Val: 1, Next: &ListNode{Val: 9}}}},
+		val:    5,
+		expect: &ListNode{Val: 4, Next: &ListNode{Val: 1, Next: &ListNode{Val: 9}}},
+	},
+	{
+		name:   "TestCase 1",
+		inputs: &ListNode{Val: 4, Next: &ListNode{Val: 5, Next: &ListNode{Val: 1, Next: &ListNode{Val: 9}}}},
+		val:    4,
+		expect: &ListNode{Val: 5, Next: &ListNode{Val: 1, Next: &ListNode{Val: 9}}},
+	},
+	{
+		name:   "TestCase 1",
+		inputs: nil,
+		val:    5,
+		expect: nil,
+	},
+}
+
+// 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, c.val)
+				ast.Equal(c.expect, actual,
+					"func: %v case: %v ",
+					runtime.FuncForPC(reflect.ValueOf(f).Pointer()).Name(), c.name)
+			})
+		}
+	}
+}

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

@@ -0,0 +1,18 @@
+package Solution
+
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}
+
+func getKthFromEnd(head *ListNode, k int) *ListNode {
+	left, right := head, head
+	for i := 0; i < k; i++ {
+		right = right.Next
+	}
+	for right != nil {
+		right = right.Next
+		left = left.Next
+	}
+	return left
+}

lcof/of022/Solution_test.go

@@ -0,0 +1,49 @@
+package Solution
+
+import (
+	"github.com/stretchr/testify/assert"
+	"reflect"
+	"runtime"
+	"testing"
+)
+
+//	solution func Info
+type SolutionFuncType func(*ListNode, int) *ListNode
+
+var SolutionFuncList = []SolutionFuncType{
+	getKthFromEnd,
+}
+
+//	test info struct
+type Case struct {
+	name   string
+	inputs *ListNode
+	val    int
+	expect *ListNode
+}
+
+// 	test case
+var cases = []Case{
+	{
+		name:   "TestCase 1",
+		inputs: &ListNode{Val: 4, Next: &ListNode{Val: 5, Next: &ListNode{Val: 1, Next: &ListNode{Val: 9}}}},
+		val:    2,
+		expect: &ListNode{Val: 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, c.val)
+				ast.Equal(c.expect.Val, actual.Val,
+					"func: %v case: %v ",
+					runtime.FuncForPC(reflect.ValueOf(f).Pointer()).Name(), c.name)
+			})
+		}
+	}
+}

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

@@ -0,0 +1,37 @@
+package Solution
+
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}
+
+func reverseList(head *ListNode) *ListNode {
+	if head == nil || head.Next == nil {
+		return head
+	}
+	newHead := reverseList(head.Next)
+	head.Next.Next = head
+	head.Next = nil
+	return newHead
+}
+
+//func reverseList2(head *ListNode) *ListNode {
+//	var pre  *ListNode
+//	var next *ListNode
+//	for head != nil {
+//		next = head.Next
+//		head.Next = pre
+//		pre = head
+//		head = next
+//	}
+//	return pre
+//}
+
+//func reverseList3(head *ListNode) *ListNode {
+//	var prev *ListNode
+//
+//	for head != nil {
+//		head.Next, head, prev = prev, head.Next, head
+//	}
+//	return prev
+//}