文章作者：Tyan
博客：noahsnail.com ?|? CSDN ?|? 簡(jiǎn)書

1. Description

Next Greater Node In Linked List

2. Solution

解析：Version 1，這個(gè)題跟Leetcode 503. Next Greater Element II非常相似，只不過是把數(shù)組換成了鏈表，參考https://blog.csdn.net/Quincuntial/article/details/118733487即可。

• Version 1

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def nextLargerNodes(self, head: ListNode) -> List[int]:
        result = []
        nums = []
        node = head
        index = 0
        stack = []
        while node:
            while stack and nums[stack[-1]] < node.val:
                result[stack.pop()] = node.val
            nums.append(node.val)
            result.append(0)
            stack.append(index)
            node = node.next
            index += 1
        return result

Reference

1. https://leetcode.com/problems/next-greater-node-in-linked-list/