💖 测试更新Readme

Author: 6boris

README.md

@@ -11,35 +11,35 @@ LeetCode of algorithms with golang solution(updating:smiley:).
 | # | Title | Solution | Acceptance | Difficulty | Tag |
 | :--- | :--------------- | :------------- | :------------- | :------------- | :------------- |
 | 1 | [Two Sum][0001-url] | [Golang][0001-golang] | 39.0% |:purple_heart: |:eyes:|
-| 2 | [Add Two Numbers][0002-url] | [Golang][0002-golang] | 29.2% |:purple_heart: |:star:|
-| 3 | [Longest Substring Without Repeating Characters][0003-url] | [Golang][0003-golang] | 25.1% |:purple_heart: |:eyes:|
-| 4 | [Median of Two Sorted Arrays ][0004-url] | [Golang][0004-golang] | 24.1% |:purple_heart: |:eyes: |
-| 5 | [Longest Palindromic Substring ][0005-url] | [Golang][0005-golang] |	25.6% |:purple_heart: |:eyes: |
-| 6 | [ZigZag Conversion][0006-url] | [Golang][0006-golang] |28.8% |:purple_heart: |:eyes: |
+| 2 | [Add Two Numbers][0002-url] | [Golang][0002-golang] | 29.2% |:purple_heart: :purple_heart: |:star:|
+| 3 | [Longest Substring Without Repeating Characters][0003-url] | [Golang][0003-golang] | 25.1% |:purple_heart: :purple_heart:|:eyes:|
+| 4 | [Median of Two Sorted Arrays ][0004-url] | [Golang][0004-golang] | 24.1% |:purple_heart: :purple_heart::purple_heart: |:eyes: |
+| 5 | [Longest Palindromic Substring ][0005-url] | [Golang][0005-golang] |	25.6% |:purple_heart: :purple_heart: |:eyes: |
+| 6 | [ZigZag Conversion][0006-url] | [Golang][0006-golang] |28.8% |:purple_heart::purple_heart: |:eyes: |
 | 7 | [Reverse Integer][0007-url] | [Golang][0007-golang] |	24.5% |:purple_heart: |:eyes: |
-| 8 | [String to Integer (atoi)][0008-url] | [Golang][0008-golang] |	14.2% |:purple_heart: |:eyes: |
+| 8 | [String to Integer (atoi)][0008-url] | [Golang][0008-golang] |	14.2% |:purple_heart: :purple_heart: |:eyes: |
 | 9 | [Palindrome Number][0009-url] | [Golang][0009-golang] | 38.9% |:purple_heart: |:eyes: |
-| 10 | [Regular Expression Matching][0010-url] | [Golang][nil] | 24.4% |:purple_heart: | :eyes:|
-| 11 | [Container With Most Water][0011-url] | [Golang][nil] | 24.4% |:purple_heart: |:eyes: |
-| 12 | [Integer to Roman][0012-url] | [Golang][nil] | 24.4% |:purple_heart: |:eyes: |
-| 13 | [Roman to Integer][0013-url] | [Golang][nil] | 24.4% |:purple_heart: | :eyes:|
-| 14 | [Longest Common Prefix][0014-url] | [Golang][nil] | 24.4% |:purple_heart: | :eyes:|
-| 15 | [3Sum][0015-url] | [Golang][nil] | 24.4% |:purple_heart: |:eyes: |
-| 16 | [3Sum Closest][0016-url] | [Golang][nil] | 24.4% |:purple_heart: |:eyes: |
-| 17 | [Letter Combinations of a Phone Number][0017-url] | [Golang][nil] | 24.4% |:purple_heart: |:eyes: |
-| 18 | [4Sum][0018-url] | [Golang][nil] | 24.4% |:purple_heart: |:eyes: |
-| 19 | [Remove Nth Node From End of List][0018-url] | [Golang][nil] | 24.4% |:purple_heart: | :eyes:|
-| 20 | [Valid Parentheses ][0020-url] | [Golang][nil] | 24.4% |:trollface: | :eyes:|
+| 10 | [Regular Expression Matching][0010-url] | [Golang][0010-golang] | 24.4% |:purple_heart::purple_heart::purple_heart: | :eyes:|
+| 11 | [Container With Most Water][0011-url] | [Golang][0011-golang] | 39.3% |:purple_heart: :purple_heart: |:eyes: |
+| 12 | [Integer to Roman][0012-url] | [Golang][0012-golang] | 48.0% |:purple_heart::purple_heart: |:eyes: |
+| 13 | [Roman to Integer][0013-url] | [Golang][0013-golang] | 49.7% |:purple_heart: | :eyes:|
+| 14 | [Longest Common Prefix][0014-url] | [Golang][0014-golang] | 32.0% |:purple_heart: | :eyes:|
+| 15 | [3Sum][0015-url] | [Golang][0015-golang] | 22.2% |:purple_heart: :purple_heart: |:eyes: |
+| 16 | [3Sum Closest][0016-url] | [Golang][0016-golang] | 32.8% |:purple_heart: :purple_heart:|:eyes: |
+| 17 | [Letter Combinations of a Phone Number][0017-url] | [Golang][0017-golang] | 38.4% |:purple_heart: :purple_heart: |:eyes: |
+| 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:|
 
 
 
 [src]: https://github.com/kylesliu/awesome-golang-leetcode
 [companies]: https://github.com/kylesliu/awesome-golang-leetcode/blob/master/Companies.md
 
-[0001-url]: https://leetcode.com/problems/add-two-numbers
+[0001-url]: https://leetcode.com/problems/two-sum
 [0001-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
 
-[0002-url]: https://leetcode.com/problems/longest-substring-without-repeating-characters
+[0002-url]: https://leetcode.com/problems/add-two-numbers
 [0002-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0002.Add-Two-Numbers
 
 [0003-url]: https://leetcode.com/problems/longest-substring-without-repeating-characters
@@ -64,34 +64,34 @@ LeetCode of algorithms with golang solution(updating:smiley:).
 [0009-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0009.Palindrome-Number
 
 [0010-url]: https://leetcode.com/problems/regular-expression-matching
-[0010-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+[0010-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0010.Regular-Expression-Matching
 
 [0011-url]: https://leetcode.com/problems/container-with-most-water
-[0011-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+[0011-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0011.Container-With-Most-Water
 
 [0012-url]: https://leetcode.com/problems/integer-to-roman
-[0012-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+[0012-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0012.Integer-to-Roman
 
 [0013-url]: https://leetcode.com/problems/roman-to-integer
-[0013-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+[0013-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0013.Roman-to-Integer
 
 [0014-url]: https://leetcode.com/problems/longest-common-prefix
-[0014-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+[0014-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0014.Longest-Common-Prefix
 
 [0015-url]: https://leetcode.com/problems/3sum
-[0015-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+[0015-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0015.3Sum
 
 [0016-url]: https://leetcode.com/problems/3sum-closest
-[0016-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+[0016-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0016.3Sum-Closest
 
 [0017-url]: https://leetcode.com/problems/letter-combinations-of-a-phone-number
-[0017-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+[0017-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0017.Letter-Combinations-of-a-Phone-Number
 
 [0018-url]: https://leetcode.com/problems/4sum
-[0018-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+[0018-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0018.4Sum
 
 [0019-url]: https://leetcode.com/problems/remove-nth-node-from-end-of-list
-[0019-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+[0019-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0019.Remove-Nth-Node-From-End-of-List
 
 [0020-url]: https://leetcode.com/problems/valid-parentheses
-[0020-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
+[0020-golang]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0020.Valid-Parentheses

src/0004.Median-of-Two-Sorted-Arrays/README.md

@@ -0,0 +1,48 @@
+# [4. Median of Two Sorted Arrays][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/median-of-two-sorted-arrays/description/
+[me]: https://github.com/kylesliu/awesome-golang-leetcode

src/0004.Median-of-Two-Sorted-Arrays/Solution.go

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

src/0004.Median-of-Two-Sorted-Arrays/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
+}{
+{"1 test 1", true, true},
+{"2 test 2", true, true},
+{"3 test 3", 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/0005.Longest-Palindromic-Substring/README.md

@@ -0,0 +1,48 @@
+# [5. Longest Palindromic Substring][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/longest-palindromic-substring/description/
+[me]: https://github.com/kylesliu/awesome-golang-leetcode

src/0005.Longest-Palindromic-Substring/Solution.go

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

src/0005.Longest-Palindromic-Substring/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
+}{
+{"1 test 1", true, true},
+{"2 test 2", true, true},
+{"3 test 3", 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/0010.Regular-Expression-Matching/README.md

@@ -0,0 +1,48 @@
+# [10. Regular Expression Matching][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/regular-expression-matching/description/
+[me]: https://github.com/kylesliu/awesome-golang-leetcode

src/0010.Regular-Expression-Matching/Solution.go

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

src/0010.Regular-Expression-Matching/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
+}{
+{"1 test 1", true, true},
+{"2 test 2", true, true},
+{"3 test 3", 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)
+}
+})
+}
+}