Leetcode 1019. Next Greater Node In Linked List

文章作者：Tyan
博客：noahsnail.com  |  CSDN  |  简书

1. Description

2. Solution

**解析：**Version 1，这个题跟Leetcode 503. Next Greater Element II非常相似，只不过是把数组换成了链表，参考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 = headindex = 0stack = []while node:while stack and nums[stack[-1]] < node.val:result[stack.pop()] = node.valnums.append(node.val)result.append(0)stack.append(index)node = node.nextindex += 1return result

Reference

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