| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.FinalPricesWithSpecialDiscountInShop; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class FinalPricesWithSpecialDiscountInShopStack : IFinalPricesWithSpecialDiscountInShop |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="prices"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int[] FinalPrices(int[] prices) |
| | 3 | 24 | | { |
| | 3 | 25 | | var stack = new Stack<int>(); |
| | | 26 | | |
| | 34 | 27 | | for (var i = 0; i < prices.Length; i++) |
| | 14 | 28 | | { |
| | 19 | 29 | | while (stack.Count > 0 && prices[stack.Peek()] >= prices[i]) |
| | 5 | 30 | | { |
| | 5 | 31 | | prices[stack.Pop()] -= prices[i]; |
| | 5 | 32 | | } |
| | | 33 | | |
| | 14 | 34 | | stack.Push(i); |
| | 14 | 35 | | } |
| | | 36 | | |
| | 3 | 37 | | return prices; |
| | 3 | 38 | | } |
| | | 39 | | } |