You are given an integer 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 integer array?answer?where?answer[i]?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]

------------------------------------------

給你一個數(shù)組 prices ，其中 prices[i] 是商店里第 i 件商品的價格。

商店里正在進(jìn)行促銷活動，如果你要買第 i 件商品，那么你可以得到與 prices[j] 相等的折扣，其中 j 是滿足 j > i 且 prices[j] <= prices[i] 的 最小下標(biāo) ，如果沒有滿足條件的 j ，你將沒有任何折扣。

請你返回一個數(shù)組，數(shù)組中第 i 個元素是折扣后你購買商品 i 最終需要支付的價格。

下面是代碼：

Runtime:?0 ms, faster than?100.00%?of?Java?online submissions for?Final Prices With a Special Discount in a Shop.

Memory Usage:?43.5 MB, less than?91.82%?of?Java?online submissions for?Final Prices With a Special Discount in a Shop.