algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-07 01:44:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #206 from novahe/fix/1019

Browse Source 
fix 1019: update solution
This commit is contained in:
halfrost
2021-12-22 19:45:05 -08:00
committed by GitHub
parent e4ea6b83a6 f49a36789f
commit d40d0e770b
2 changed files with 25 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
leetcode/1019.Next-Greater-Node-In-Linked-List/1019. Next Greater Node In Linked List.go
View File

@ -14,25 +14,22 @@ type ListNode = structures.ListNode
* Next *ListNode
* }
*/
// 解法一 单调栈
func nextLargerNodes(head *ListNode) []int {
res, indexes, nums := make([]int, 0), make([]int, 0), make([]int, 0)
p := head
for p != nil {
nums = append(nums, p.Val)
p = p.Next
type node struct {
index, val int
}
for i := 0; i < len(nums); i++ {
var monoStack []node
var res []int
for head != nil {
for len(monoStack) > 0 && monoStack[len(monoStack)-1].val < head.Val {
res[monoStack[len(monoStack)-1].index] = head.Val
monoStack = monoStack[:len(monoStack)-1]
}
monoStack = append(monoStack, node{len(res), head.Val})
res = append(res, 0)
}
for i := 0; i < len(nums); i++ {
num := nums[i]
for len(indexes) > 0 && nums[indexes[len(indexes)-1]] < num {
index := indexes[len(indexes)-1]
res[index] = num
indexes = indexes[:len(indexes)-1]
}
indexes = append(indexes, i)
head = head.Next
}
return res
}

28
website/content/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md
View File

@ -70,29 +70,27 @@ package leetcode
* Next *ListNode
* }
*/
// 解法一 单调栈
func nextLargerNodes(head *ListNode) []int {
res, indexes, nums := make([]int, 0), make([]int, 0), make([]int, 0)
p := head
for p != nil {
nums = append(nums, p.Val)
p = p.Next
type node struct {
index, val int
}
for i := 0; i < len(nums); i++ {
var monoStack []node
var res []int
for head != nil {
for len(monoStack) > 0 && monoStack[len(monoStack)-1].val < head.Val {
res[monoStack[len(monoStack)-1].index] = head.Val
monoStack = monoStack[:len(monoStack)-1]
}
monoStack = append(monoStack, node{len(res), head.Val})
res = append(res, 0)
}
for i := 0; i < len(nums); i++ {
num := nums[i]
for len(indexes) > 0 && nums[indexes[len(indexes)-1]] < num {
index := indexes[len(indexes)-1]
res[index] = num
indexes = indexes[:len(indexes)-1]
}
indexes = append(indexes, i)
head = head.Next
}
return res
}
```