算法模板之单调递减栈

模板代码

public void function(int[] nums){
	int LEN = nums.length;
    for (int i = LEN - 1;i >= 0;i--){
        while (!stack.empty() && nums[i] > stack.peek()){
            stack.pop();
        }
        stack.push(nums[i]);
    }
}