Steps to Make Array Non-decreasing
You are given a 0-indexed integer array nums. In one step, remove all elements nums[i] where nums[i - 1] > nums[i] for all 0 < i < nums.length.
Return the number of steps performed until nums becomes a non-decreasing array.
Example 1
Input
nums = [5,3,4,4,7,3,6,11,8,5,11]Output
3After three removal steps, the array becomes [5, 7, 11, 11], which is non-decreasing.
Example 2
Input
nums = [4,5,7,7,13]Output
0nums is already a non-decreasing array, so no steps are needed.
Constraints
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^9