383. Count Nodes Deleted (Greater Value on Right)

Given a singly linked list, consider deleting every node that has a strictly greater value somewhere to its right. Return how many nodes would be deleted.

Input: An array of node values.

Output: Integer — number of nodes deleted.

Examples

Input: [12,15,10,11,5,6,2,3]
Output: 4
Explanation: 4 nodes have a greater value on their right.

Input: [10,20,30,40]
Output: 3
Explanation: All but the last are deleted.

Input: [40,30,20,10]
Output: 0
Explanation: None deleted.

Constraints

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

Asked by