Daily LeetCode – day0034 1475. Final Prices With a Special Discount in a Shop

// 1475. Final Prices With a Special Discount in a Shop
class Solution {
    public int[] finalPrices(int[] prices) {
        int len = prices.length;
        for (int i = 0; i < len; ++i) {
            for (int j = i + 1; j < len; ++j) {
                if (prices[i] >= prices[j]) {
                    prices[i] = prices[i] - prices[j];
                    break;
                }
            }
        }
        return prices;
    }
}

学习笔记：
9月第1天，果然是一道简单题。数组题。
一开始手写了单调栈来做，但是连续两个相等的数字不太好操作就放弃了，还是双重循环最简单了。