|
2 | 2 |
|
3 | 3 | importcom.fishercoder.common.classes.ListNode; |
4 | 4 |
|
5 | | -/** |
6 | | - * 1019. Next Greater Node In Linked List |
7 | | - * |
8 | | - * We are given a linked list with head as the first node. Let's number the nodes in the list: node_1, node_2, node_3, ... etc. |
9 | | - * Each node may have a next larger value: for node_i, next_larger(node_i) is the node_j.val such that j > i, node_j.val > node_i.val, |
10 | | - * and j is the smallest possible choice. If such a j does not exist, the next larger value is 0. |
11 | | - * Return an array of integers answer, where answer[i] = next_larger(node_{i+1}). |
12 | | - * Note that in the example inputs (not outputs) below, arrays such as [2,1,5] represent the serialization of a linked list |
13 | | - * with a head node value of 2, second node value of 1, and third node value of 5. |
14 | | - * |
15 | | - * Example 1: |
16 | | - * Input: [2,1,5] |
17 | | - * Output: [5,5,0] |
18 | | - * |
19 | | - * Example 2: |
20 | | - * Input: [2,7,4,3,5] |
21 | | - * Output: [7,0,5,5,0] |
22 | | - * |
23 | | - * Example 3: |
24 | | - * Input: [1,7,5,1,9,2,5,1] |
25 | | - * Output: [7,9,9,9,0,5,0,0] |
26 | | - * |
27 | | - * Note: |
28 | | - * 1 <= node.val <= 10^9 for each node in the linked list. |
29 | | - * The given list has length in the range [0, 10000]. |
30 | | - * */ |
31 | 5 | publicclass_1019 { |
32 | 6 | publicstaticclassSolution1 { |
33 | 7 | publicint[]nextLargerNodes(ListNodehead) { |
|