feat: finish 38 83 problem

Author: plh97

algorithm/38.CountandSay/main.go

@@ -1,39 +1,28 @@
 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:]
+		j := 0
+		for j < len(res) {
+
+			count := 1
+			e := res[j]
+
+			for j < len(res)-1 && res[j] == res[j+1] {
+				count++
+				j++
 			}
+			j++
+			temp += strconv.Itoa(count)
+			temp += string(e)
+
 		}
 		res = temp
 	}

algorithm/38.CountandSay/main_test.go

@@ -10,30 +10,10 @@ var tcs = []struct {
 	N1  int
 	ans string
 }{
-	// {
-	// 	1,
-	// 	"1",
-	// },
-	// {
-	// 	2,
-	// 	"11",
-	// },
-	// {
-	// 	3,
-	// 	"21",
-	// },
-	// {
-	// 	4,
-	// 	"1211",
-	// },
-	// {
-	// 	5,
-	// 	"111221",
-	// },
-	// {
-	// 	6,
-	// 	"312211",
-	// },
+	{
+		6,
+		"312211",
+	},
 }
 
 func Test_bitwiseComplement(t *testing.T) {

algorithm/83.RemoveDuplicatesfromSortedList/README.md

@@ -0,0 +1,21 @@
+# [83. Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)
+
+## 2019/09/15
+
+### 题目 💗[medium]
+
+Given a sorted linked list, delete all duplicates such that each element appear only once.
+
+Example 1:
+
+```bash
+Input: 1->1->2
+Output: 1->2
+```
+
+Example 2:
+
+```bash
+Input: 1->1->2->3->3
+Output: 1->2->3
+```

algorithm/83.RemoveDuplicatesfromSortedList/main.go

@@ -0,0 +1,35 @@
+package deleteDuplicates
+
+import (
+	"github.com/pengliheng/leetcode/Helper"
+)
+
+type ListNode = Helper.ListNode
+
+func deleteDuplicates(head *ListNode) *ListNode {
+	arr := []int{}
+	for head != nil {
+		// remove duplicate
+		if lastIndexOf(arr, head.Val) == -1 {
+			arr = append(arr, head.Val)
+		}
+		head = head.Next
+	}
+	node := &ListNode{Val: 0}
+	newHead := node
+	for len(arr) > 0 {
+		node.Next = &ListNode{Val: arr[0]}
+		node = node.Next
+		arr = arr[1:]
+	}
+	return newHead.Next
+}
+
+func lastIndexOf(nums []int, val int) int {
+	for i := len(nums) - 1; i >= 0; i-- {
+		if nums[i] == val {
+			return i
+		}
+	}
+	return -1
+}

algorithm/83.RemoveDuplicatesfromSortedList/main_test.go

@@ -0,0 +1,30 @@
+package deleteDuplicates
+
+import (
+	"testing"
+
+	"github.com/pengliheng/leetcode/Helper"
+
+	"github.com/stretchr/testify/assert"
+)
+
+var tcs = []struct {
+	N1  *ListNode
+	ans *ListNode
+}{
+	{
+		Helper.Ints2LinkList([]int{1, 1, 2}),
+		Helper.Ints2LinkList([]int{1, 2}),
+	},
+	{
+		Helper.Ints2LinkList([]int{1, 1, 2, 3, 3}),
+		Helper.Ints2LinkList([]int{1, 2, 3}),
+	},
+}
+
+func Test_bitwiseComplement(t *testing.T) {
+	ast := assert.New(t)
+	for _, tc := range tcs {
+		ast.Equal(tc.ans, deleteDuplicates(tc.N1), "输入:%v", tc)
+	}
+}