Solution (leetcode-in-java 1.23 API)

java.lang.Object
- g1001_1100.s1019_next_greater_node_in_linked_list.Solution

```
public class Solution
extends Object
```
1019 - Next Greater Node In Linked List.
Medium

You are given the head of a linked list with n nodes.

For each node in the list, find the value of the next greater node. That is, for each node, find the value of the first node that is next to it and has a strictly larger value than it.

Return an integer array answer where answer[i] is the value of the next greater node of the i^th node ( 1-indexed ). If the i^th node does not have a next greater node, set answer[i] = 0.

Example 1:

Input: head = [2,1,5]

Output: [5,5,0]

Example 2:

Input: head = [2,7,4,3,5]

Output: [7,0,5,5,0]

Constraints:
- The number of nodes in the list is n.
- 1 <= n <= 10⁴
- 1 <= Node.val <= 10⁹

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int[] nextLargerNodes(ListNode head)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

nextLargerNodes

public int[] nextLargerNodes(ListNode head)