/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/funcnextLargerNodes(head *ListNode)[]int{var res []int
p := head
// 1. 存到数组里var nums []intfor p !=nil{
nums =append(nums, p.Val)
p = p.Next
}for i :=0; i <len(nums); i++{
res =append(res,0)}var indexes []intfor i :=0; i <len(nums); i++{
num := nums[i]forlen(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)}return res
}
LeetCode1019. 链表中的下一个更大节点1. 问题描述2. 思路2.1. 思路一存到数组中2.2. 思路二反转链表单调栈3. 代码/** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */func nextLargerNodes(head *ListNode) []int { var res [