Commit625db12

committed

update the 38 problem solution

1 parent3af63bb commit625db12Copy full SHA for 625db12

File tree

+51

-18

lines changed

+51

-18

lines changed

Lines changed: 4 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -42,9 +42,10 @@ LeetCode of algorithms with golang solution(updating:smiley:).`
`42`	`42`
`43`	`43`	`##Community`
`44`	`44`
`45`		`-*[ACWING](https://www.acwing.com/) 一些算法竞赛大佬创建的平台，挺适合入门的。`
`46`		`-*[leetbook](https://github.com/hk029/leetbook) 某位大佬写的Leetcode题解，不过已经不更新了`
`47`		`-*[LeetCode-in-Go](https://github.com/aQuaYi/LeetCode-in-Go) 某位算法大佬的Golang题解`
	`45`	`+-[ACWING](https://www.acwing.com/) 一些算法竞赛大佬创建的平台，挺适合入门的。`
	`46`	`+-[leetbook](https://github.com/hk029/leetbook) 某位大佬写的Leetcode题解，不过已经不更新了`
	`47`	`+-[WANG leetcode](https://github.com/wind-liang/leetcode) 某位朋友的Leetcode题解。经常更新，解释到位。`
	`48`	`+-[LeetCode-in-Go](https://github.com/aQuaYi/LeetCode-in-Go) 某位算法大佬的Golang题解`
`48`	`49`
`49`	`50`	`##Contributors`
`50`	`51`

Lines changed: 14 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -40,8 +40,21 @@ Output: "1211"`
`40`	`40`
`41`	`41`
`42`	`42`	`##题解`
	`43`	`+>题意：这道题的意思特别刚，不太好理解`
	`44`	`+`
	`45`	+```
	`46`	`+初始值第一行是 1。`
	`47`	`+第二行读第一行，1 个 1，去掉个字，所以第二行就是 11。`
	`48`	`+第三行读第二行，2 个 1，去掉个字，所以第三行就是 21。`
	`49`	`+第四行读第三行，1 个 2，1 个 1，去掉所有个字，所以第四行就是 1211。`
	`50`	`+第五行读第四行，1 个 1，1 个 2，2 个 1，去掉所有个字，所以第五航就是 111221。`
	`51`	`+第六行读第五行，3 个 1，2 个 2，1 个 1，去掉所以个字，所以第六行就是 312211。`
	`52`	`+然后题目要求输入 1 - 30 的任意行数，输出该行是啥。`
	`53`	+```
	`54`	`+`
`43`	`55`	`###思路1`
`44`		`-在遍历数组时用 Stack 把数组中的数存起来，如果当前遍历的数比栈顶元素来的大，说明栈顶元素的下一个比它大的数就是当前元素。`
	`56`	`+直接按照从2到n的顺序生成字符串，即每次找连续相同的数字段，合并。`
	`57`	`+`
`45`	`58`	```go
`46`	`59`	`funccountAndSay(nint)string {`
`47`	`60`	`if n <1 {`

Lines changed: 3 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,7 @@`
`1`	`1`	`package Solution`
`2`	`2`
	`3`	`+import"fmt"`
	`4`	`+`
`3`	`5`	`funccountAndSay(nint)string {`
`4`	`6`	`ifn<1 {`
`5`	`7`	`return""`
`@@ -13,6 +15,7 @@ func countAndSay(n int) string {`
`13`	`15`	`cnt++`
`14`	`16`	`ifj==len(say)-1\|\|say[j]!=say[j+1] {`
`15`	`17`	`nextSay=append(nextSay,48+cnt,say[j])// 48 - the ASCII code point of "0"`
	`18`	`+fmt.Println(string(nextSay),string(48+cnt),string(say[j]))`
`16`	`19`	`cnt=0`
`17`	`20`	`}`
`18`	`21`	`}`

Lines changed: 30 additions & 14 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,24 +1,40 @@`
`1`	`1`	`package Solution`
`2`	`2`
`3`	`3`	`import (`
	`4`	`+"reflect"`
	`5`	`+"strconv"`
`4`	`6`	`"testing"`
`5`	`7`	`)`
`6`	`8`
`7`	`9`	`funcTestSolution(t*testing.T) {`
`8`		`-t.Run("Test-1",func(t*testing.T) {`
`9`		`-got:=countAndSay(1)`
`10`		`-want:="1"`
`11`		`-ifgot!=want {`
`12`		`-t.Error("GOT:",got,"WANT:",want)`
`13`		`-}`
`14`		`-})`
	`10`	`+//测试用例`
	`11`	`+cases:= []struct {`
	`12`	`+namestring`
	`13`	`+inputsint`
	`14`	`+expectstring`
	`15`	`+}{`
	`16`	`+{"TestCase",1,"1"},`
	`17`	`+{"TestCase",4,"1211"},`
	`18`	`+}`
`15`	`19`
`16`		`-t.Run("Test-2",func(t*testing.T) {`
`17`		`-got:=countAndSay(4)`
`18`		`-want:="1211"`
`19`		`-ifgot!=want {`
`20`		`-t.Error("GOT:",got,"WANT:",want)`
`21`		`-}`
`22`		`-})`
	`20`	`+//开始测试`
	`21`	`+fori,c:=rangecases {`
	`22`	`+t.Run(c.name+" "+strconv.Itoa(i),func(t*testing.T) {`
	`23`	`+got:=countAndSay(c.inputs)`
	`24`	`+if!reflect.DeepEqual(got,c.expect) {`
	`25`	`+t.Fatalf("expected: %v, but got: %v, with inputs: %v",`
	`26`	`+c.expect,got,c.inputs)`
	`27`	`+}`
	`28`	`+})`
	`29`	`+}`
	`30`	`+}`
	`31`	`+`
	`32`	`+//压力测试`
	`33`	`+funcBenchmarkSolution(b*testing.B) {`
	`34`	`+`
	`35`	`+}`
	`36`	`+`
	`37`	`+//使用案列`
	`38`	`+funcExampleSolution() {`
`23`	`39`
`24`	`40`	`}`

Comments

(0)