🐮 add some linklist problem

Author: 6boris

README.md

@@ -30,6 +30,11 @@ LeetCode of algorithms with golang solution(updating:smiley:).
 | 18 | [4Sum][0018-url] | [Golang][0018-golang] | 28.5% |:purple_heart::purple_heart: |:eyes: |
 | 19 | [Remove Nth Node From End of List][0018-url] | [Golang][0019-golang] | 33.6% |:purple_heart: :purple_heart: | :eyes:|
 | 20 | [Valid Parentheses ][0020-url] | [Golang][0020-golang] | 34.7% |:purple_heart: | :eyes:|
+| 24 | [Swap Nodes in Pairs ][0020-url] | Golang | 41.2% |:purple_heart: :purple_heart: | :eyes:|
+| 25 | [Reverse Nodes in k-Group ][0020-url] | Golang | 33.6% |:purple_heart::purple_heart::purple_heart: | :eyes:|
+| 141 | [Linked List Cycle ][0020-url] | Golang | 34.6% |:purple_heart: | :eyes:|
+| 142 | [Linked List Cycle II ][0020-url] | Golang |	29.9% |:purple_heart: | :eyes:|
+| 206 | [Reverse Linked List ][0020-url] | Golang | 50.0% |:purple_heart: | :eyes:|
 
 
 
@@ -95,3 +100,20 @@ LeetCode of algorithms with golang solution(updating:smiley:).
 
 [0020-url]: https://leetcode.com/problems/valid-parentheses
 [0020-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0020.Valid-Parentheses
+
+
+[0024-url]: https://leetcode.com/problems/two-sum
+[0024-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+
+[0025-url]: https://leetcode.com/problems/two-sum
+[0025-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+
+[0141-url]: https://leetcode.com/problems/two-sum
+[0141-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+
+[0142-url]: https://leetcode.com/problems/two-sum
+[0142-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+
+[0206-url]: https://leetcode.com/problems/two-sum
+[0206-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+

src/0025.Reverse-Nodes-in-k-Group/README.md

@@ -0,0 +1,48 @@
+# [1. Add Sum][title]
+
+## Description
+
+Given two binary strings, return their sum (also a binary string).
+
+The input strings are both **non-empty** and contains only characters `1` or `0`.
+
+**Example 1:**
+
+```
+Input: a = "11", b = "1"
+Output: "100"
+```
+
+**Example 2:**
+
+```
+Input: a = "1010", b = "1011"
+Output: "10101"
+```
+
+**Tags:** Math, String
+
+## 题意
+>给你两个二进制串，求其和的二进制串。
+
+## 题解
+
+### 思路1
+> 按照小学算数那么来做，用 `carry` 表示进位，从后往前算，依次往前，每算出一位就插入到最前面即可，直到把两个二进制串都遍历完即可。
+
+```go
+
+```
+
+### 思路2
+> 思路2
+```go
+
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-leetcode][me]
+
+[title]: https://leetcode.com/problems/two-sum/description/
+[me]: https://github.com/kylesliu/awesome-golang-leetcode

src/0025.Reverse-Nodes-in-k-Group/Solution.go

@@ -0,0 +1,5 @@
+package Solution
+
+func Solution(x bool) bool {
+return x
+}

src/0025.Reverse-Nodes-in-k-Group/Solution_test.go

@@ -0,0 +1,30 @@
+package Solution
+
+import (
+"reflect"
+"testing"
+)
+
+func TestSolution(t *testing.T) {
+//	测试用例
+cases := []struct {
+name string
+inputs bool
+expect bool
+}{
+{"TestCacse 1", true, true},
+{"TestCacse 1", true, true},
+{"TestCacse 1", false, true},
+}
+
+//	开始测试
+for _, c := range cases {
+t.Run(c.name, func(t *testing.T) {
+ret := Solution(c.inputs)
+if !reflect.DeepEqual(ret, c.expect) {
+t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+c.expect, ret, c.inputs)
+}
+})
+}
+}

src/0141.Linked-List-Cycle/README.md

@@ -0,0 +1,48 @@
+# [1. Add Sum][title]
+
+## Description
+
+Given two binary strings, return their sum (also a binary string).
+
+The input strings are both **non-empty** and contains only characters `1` or `0`.
+
+**Example 1:**
+
+```
+Input: a = "11", b = "1"
+Output: "100"
+```
+
+**Example 2:**
+
+```
+Input: a = "1010", b = "1011"
+Output: "10101"
+```
+
+**Tags:** Math, String
+
+## 题意
+>给你两个二进制串，求其和的二进制串。
+
+## 题解
+
+### 思路1
+> 按照小学算数那么来做，用 `carry` 表示进位，从后往前算，依次往前，每算出一位就插入到最前面即可，直到把两个二进制串都遍历完即可。
+
+```go
+
+```
+
+### 思路2
+> 思路2
+```go
+
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-leetcode][me]
+
+[title]: https://leetcode.com/problems/two-sum/description/
+[me]: https://github.com/kylesliu/awesome-golang-leetcode

src/0141.Linked-List-Cycle/Solution.go

@@ -0,0 +1,5 @@
+package Solution
+
+func Solution(x bool) bool {
+return x
+}

src/0141.Linked-List-Cycle/Solution_test.go

@@ -0,0 +1,30 @@
+package Solution
+
+import (
+"reflect"
+"testing"
+)
+
+func TestSolution(t *testing.T) {
+//	测试用例
+cases := []struct {
+name string
+inputs bool
+expect bool
+}{
+{"TestCacse 1", true, true},
+{"TestCacse 1", true, true},
+{"TestCacse 1", false, true},
+}
+
+//	开始测试
+for _, c := range cases {
+t.Run(c.name, func(t *testing.T) {
+ret := Solution(c.inputs)
+if !reflect.DeepEqual(ret, c.expect) {
+t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+c.expect, ret, c.inputs)
+}
+})
+}
+}

src/0142.Linked-List-Cycle-II/README.md

@@ -0,0 +1,48 @@
+# [1. Add Sum][title]
+
+## Description
+
+Given two binary strings, return their sum (also a binary string).
+
+The input strings are both **non-empty** and contains only characters `1` or `0`.
+
+**Example 1:**
+
+```
+Input: a = "11", b = "1"
+Output: "100"
+```
+
+**Example 2:**
+
+```
+Input: a = "1010", b = "1011"
+Output: "10101"
+```
+
+**Tags:** Math, String
+
+## 题意
+>给你两个二进制串，求其和的二进制串。
+
+## 题解
+
+### 思路1
+> 按照小学算数那么来做，用 `carry` 表示进位，从后往前算，依次往前，每算出一位就插入到最前面即可，直到把两个二进制串都遍历完即可。
+
+```go
+
+```
+
+### 思路2
+> 思路2
+```go
+
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-leetcode][me]
+
+[title]: https://leetcode.com/problems/two-sum/description/
+[me]: https://github.com/kylesliu/awesome-golang-leetcode

src/0142.Linked-List-Cycle-II/Solution.go

@@ -0,0 +1,5 @@
+package Solution
+
+func Solution(x bool) bool {
+return x
+}

src/0142.Linked-List-Cycle-II/Solution_test.go

@@ -0,0 +1,30 @@
+package Solution
+
+import (
+"reflect"
+"testing"
+)
+
+func TestSolution(t *testing.T) {
+//	测试用例
+cases := []struct {
+name string
+inputs bool
+expect bool
+}{
+{"TestCacse 1", true, true},
+{"TestCacse 1", true, true},
+{"TestCacse 1", false, true},
+}
+
+//	开始测试
+for _, c := range cases {
+t.Run(c.name, func(t *testing.T) {
+ret := Solution(c.inputs)
+if !reflect.DeepEqual(ret, c.expect) {
+t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+c.expect, ret, c.inputs)
+}
+})
+}
+}