Leetcode 1475. Final Prices With a Special Discount in a Shop (previous less)

gistfile1.txt

class Solution {
    public int[] finalPrices(int[] prices) {
        Stack<Integer> stack = new Stack<>();

        for(int i = 0; i < prices.length; i++) {
            while(!stack.isEmpty() && prices[stack.peek()] >= prices[i]) {
                stack.pop();
            }
            if(!stack.isEmpty()) {
                prices[i] -= prices[stack.peek()];
            }
            stack.push(i);
        }
        
        return prices;
    }
}