feat:

Author: plh97

algorithm/160.IntersectionofTwoLinkedLists/main_test.go

@@ -8,15 +8,16 @@ import (
 	"github.com/stretchr/testify/assert"
 )
 
+var a *Helper.ListNode = Helper.Ints2LinkList([]int{4, 1, 8, 4, 5})
 var tcs = []struct {
 	N1  *Helper.ListNode
 	N2  *Helper.ListNode
-	ans int
+	ans *Helper.ListNode
 }{
 	{
 		Helper.Ints2LinkList([]int{4, 1, 8, 4, 5}),
 		Helper.Ints2LinkList([]int{5, 0, 1, 8, 4, 5}),
-		8,
+		nil,
 	},
 }
 

algorithm/38.CountandSay/README.md

@@ -0,0 +1,36 @@
+# [38. Count and Say](https://leetcode.com/problems/count-and-say/)
+
+## 2019/09/14
+
+### 题目 💗[medium]
+
+The count-and-say sequence is the sequence of integers with the first five terms as following:
+
+```bash
+1.     1
+2.     11
+3.     21
+4.     1211
+5.     111221
+```
+
+`1` is read off as "one 1" or 11.
+`11` is read off as "two 1s" or 21.
+`21` is read off as "one 2, then one 1" or 1211.
+Given an integer n where 1 ≤ n ≤ 30, generate the nth term of the count-and-say sequence.
+
+Note: Each term of the sequence of integers will be represented as a string.
+
+Example 1:
+
+```bash
+Input: 1
+Output: "1"
+```
+
+Example 2:
+
+```bash
+Input: 4
+Output: "1211"
+```

algorithm/38.CountandSay/main.go

@@ -0,0 +1,41 @@
+package countAndSay
+
+import (
+	"fmt"
+	"strconv"
+)
+
+func countAndSay(n int) string {
+	res := "1"
+	for n > 1 {
+		fmt.Println("=============times ============", n, res)
+		n--
+		temp := ""
+		for len(res) > 0 {
+			times := 0
+			for len(res) > 0 && res[0] == '1' {
+				times++
+				res = res[1:]
+			}
+			if times == 1 {
+				if len(res) == 0 {
+					temp += "11"
+					continue
+				} else {
+					temp += "1"
+				}
+			} else if times == 0 {
+				temp += "1"
+				temp += res[0:1]
+			} else if times > 1 {
+				temp += strconv.Itoa(times)
+				temp += "1"
+			}
+			if len(res) > 0 {
+				res = res[1:]
+			}
+		}
+		res = temp
+	}
+	return res
+}

algorithm/38.CountandSay/main_test.go

@@ -0,0 +1,44 @@
+package countAndSay
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+var tcs = []struct {
+	N1  int
+	ans string
+}{
+	// {
+	// 	1,
+	// 	"1",
+	// },
+	// {
+	// 	2,
+	// 	"11",
+	// },
+	// {
+	// 	3,
+	// 	"21",
+	// },
+	// {
+	// 	4,
+	// 	"1211",
+	// },
+	// {
+	// 	5,
+	// 	"111221",
+	// },
+	// {
+	// 	6,
+	// 	"312211",
+	// },
+}
+
+func Test_bitwiseComplement(t *testing.T) {
+	ast := assert.New(t)
+	for _, tc := range tcs {
+		ast.Equal(tc.ans, countAndSay(tc.N1), "输入:%v", tc)
+	}
+}