Commit 6eb35a9

committed

503.下一个更大元素II增加Go版本一解法

1 parent d04090f commit 6eb35a9Copy full SHA for 6eb35a9

File tree

+34

-0

lines changed

+34

-0

lines changed

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -213,6 +213,40 @@ class Solution:`
`213`	`213`	`### Go:`
`214`	`214`
`215`	`215`	```go
	`216`	`+// 版本一`
	`217`	`+func nextGreaterElements(nums []int) []int {`
	`218`	`+ // 拼接一个新的nums`
	`219`	`+ numsNew := make([]int, len(nums) * 2)`
	`220`	`+ copy(numsNew, nums)`
	`221`	`+ copy(numsNew[len(nums):], nums)`
	`222`	`+ // 用新的nums大小来初始化result`
	`223`	`+ result := make([]int, len(numsNew))`
	`224`	`+ for i := range result {`
	`225`	`+ result[i] = -1`
	`226`	`+ }`
	`227`	`+`
	`228`	`+ // 开始单调栈`
	`229`	`+ st := []int{0}`
	`230`	`+ for i := 1; i < len(numsNew); i++ {`
	`231`	`+ if numsNew[i] < numsNew[st[len(st)-1]] {`
	`232`	`+ st = append(st, i)`
	`233`	`+ } else if numsNew[i] == numsNew[st[len(st)-1]] {`
	`234`	`+ st = append(st, i)`
	`235`	`+ } else {`
	`236`	`+ for len(st) > 0 && numsNew[i] > numsNew[st[len(st)-1]] {`
	`237`	`+ result[st[len(st)-1]] = numsNew[i]`
	`238`	`+ st = st[:len(st)-1]`
	`239`	`+ }`
	`240`	`+ st = append(st, i)`
	`241`	`+ }`
	`242`	`+ }`
	`243`	`+ result = result[:len(result)/2]`
	`244`	`+ return result`
	`245`	`+}`
	`246`	+```
	`247`	`+`
	`248`	+```go
	`249`	`+// 版本二`
`216`	`250`	`func nextGreaterElements(nums []int) []int {`
`217`	`251`	`length := len(nums)`
`218`	`252`	`result := make([]int,length)`

Comments

(0)