367. Delete Nodes Having Greater Value on Right

Given a singly linked list, delete every node that has a node with a strictly greater value anywhere to its right. Return the resulting list as an array.

Input: An array of node values.

Output: Array — the list after deletions.

Examples

Input: [12,15,10,11,5,6,2,3]
Output: [15,11,6,3]
Explanation: Only nodes with no greater value on the right survive.

Input: [10,20,30,40]
Output: [40]
Explanation: Each is dominated by a later node.

Input: [40,30,20,10]
Output: [40,30,20,10]
Explanation: Already decreasing.

Constraints

• 0<=n<=10^5
• 0<=value<=10^9

Asked by