题目描述

给定数组价格，其中价格 [i] 是商店中第 i 件商品的价格。商店中的商品有特别折扣，如果您购买了第 i 件商品，那么您将获得等价于价格[j] 的折扣，其中 j 是满足 j > i 且价格[j] <= 价格[ i]，否则，您将不会获得任何折扣。

返回一个数组，其中第 i 个元素是考虑到特别折扣后您将为商店的第 i 个商品支付的最终价格。

Given the array prices where prices[i] is the price of the ith item in a shop. There is a special discount for items in the shop, if you buy the ith item, then you will receive a discount equivalent to prices[j] where j is the minimum index such that j > i and prices[j] <= prices[i], otherwise, you will not receive any discount at all.

Return an array where the ith element is the final price you will pay for the ith item of the shop considering the special discount.

Example 1:

Input: prices = [8,4,6,2,3]
Output: [4,2,4,2,3]
Explanation:
For item 0 with price[0]=8 you will receive a discount equivalent to prices[1]=4, therefore, the final price you will pay is 8 - 4 = 4.
For item 1 with price[1]=4 you will receive a discount equivalent to prices[3]=2, therefore, the final price you will pay is 4 - 2 = 2.
For item 2 with price[2]=6 you will receive a discount equivalent to prices[3]=2, therefore, the final price you will pay is 6 - 2 = 4.
For items 3 and 4 you will not receive any discount at all.
Example 2:

Input: prices = [1,2,3,4,5]
Output: [1,2,3,4,5]
Explanation: In this case, for all items, you will not receive any discount at all.
Example 3:

Input: prices = [10,1,1,6]
Output: [9,0,1,6]

思路

首先理解题，就是循环数组
如果后面最近的一个元素比当前元素小 or 等于当前元素
就用当前元素减去后面这个元素

拓展点：
考虑给for 循环命名

通过break 打断指定的循环。

代码

class Solution {
    public int[] finalPrices(int[] prices) {
        int n = prices.length;
        
        for1: for (int i = 0; i < n; i++){
            for2: for(int j = i + 1; j < n; j++){
                if  (prices[i] >= prices[j]){
                    prices[i] = prices[i] - prices[j];
                    break for2;
                } 
            }
        }
        
        return prices;
    }
}