Commitf93551a

committed

final change readme

1 parent6061321 commitf93551aCopy full SHA for f93551a

File tree

-8

lines changed

-8

lines changed

Lines changed: 5 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -36,12 +36,15 @@ Output: 2`
`36`	`36`	`##题意`
`37`	`37`	`>求摇摆序列最长序列，可以转化为数组【上升】【下降】状态的转换`
`38`	`38`
`39`		`-<palign="center"><imgsrc="../../assets/images/376_Wiggle_Subsequence.jpg"></p>`
`40`	`39`
`41`	`40`	`##题解`
`42`	`41`
`43`	`42`	`###思路1`
`44`		->按照小学算数那么来做，用`carry` 表示进位，从后往前算，依次往前，每算出一位就插入到最前面即可，直到把两个二进制串都遍历完即可。
	`43`	`+>分别定义上升下降2个状态，分别做判断`
	`44`	`+`
	`45`	`+<palign="center"style="transform:rotate(90deg);margin:150px0px;">`
	`46`	`+<img src="../../assets/images/376_Wiggle_Subsequence.jpg">`
	`47`	`+</p>`
`45`	`48`
`46`	`49`	```go
`47`	`50`	`funcwiggleMaxLength(nums []int)int {`
`@@ -81,12 +84,6 @@ func wiggleMaxLength(nums []int) int {`
`81`	`84`
`82`	`85`	```
`83`	`86`
`84`		`-###思路2`
`85`		`->思路2`
`86`		-```go
`87`		`-`
`88`		-```
`89`		`-`
`90`	`87`	`##结语`
`91`	`88`
`92`	`89`	`如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-leetcode][me]`

Comments

(0)