1475. Final Prices With a Special Discount in a Shop.

    - Language: Python.
    - Time complexity: O(n + n).
    - Space complexity: O(n).
    - Solution based on: https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/editorial/.

Author: welder87

python_solutions/lc_1475_final_prices_with_a_spec_discount_in_a_shop/lc_1475.py

@@ -36,3 +36,13 @@ def finalPricesV2(self, prices: list[int]) -> list[int]:
             # Add current index to stack
             stack.append(i)
         return result
+
+    def finalPricesV3(self, prices: list[int]) -> list[int]:
+        # Time complexity: O(n + n). Space complexity: O(n).
+        stack = []
+        for idx, price in enumerate(prices):
+            while stack and prices[stack[-1]] >= price:
+                prev_idx = stack.pop()
+                prices[prev_idx] = prices[prev_idx] - price
+            stack.append(idx)
+        return prices

python_solutions/lc_1475_final_prices_with_a_spec_discount_in_a_shop/test_lc_1475.py

@@ -36,6 +36,11 @@ def test_success_v2(lst: list[int], ans: list[int], solution: Solution):
     assert solution.finalPricesV2(lst) == ans
 
 
+@pytest.mark.parametrize(("lst", "ans"), test_cases)
+def test_success_v3(lst: list[int], ans: list[int], solution: Solution):
+    assert solution.finalPricesV3(lst) == ans
+
+
 @pytest.fixture
 def solution() -> Solution:
     return Solution()