文章作者:Tyan
博客:noahsnail.com | CSDN | 简书
1. Description
2. Solution
- Version 1
class Solution:def finalPrices(self, prices: List[int]) -> List[int]:n = len(prices)for i in range(n-1):for j in range(i+1, n):if prices[i] >= prices[j]:prices[i] = prices[i] - prices[j]breakreturn prices
Reference
- https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/