| | | 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.BuyTwoChocolates; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class BuyTwoChocolatesMinimumTwoPrices : IBuyTwoChocolates |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="prices"></param> |
| | | 22 | | /// <param name="money"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int BuyChoco(int[] prices, int money) |
| | 5 | 25 | | { |
| | 5 | 26 | | var min1 = prices[0]; |
| | 5 | 27 | | var min2 = prices[1]; |
| | | 28 | | |
| | 64 | 29 | | for (var i = 1; i < prices.Length; i++) |
| | 27 | 30 | | { |
| | 27 | 31 | | if (prices[i] < min1) |
| | 5 | 32 | | { |
| | 5 | 33 | | min2 = min1; |
| | 5 | 34 | | min1 = prices[i]; |
| | 5 | 35 | | } |
| | 22 | 36 | | else if (prices[i] < min2) |
| | 4 | 37 | | { |
| | 4 | 38 | | min2 = prices[i]; |
| | 4 | 39 | | } |
| | 27 | 40 | | } |
| | | 41 | | |
| | 5 | 42 | | var leftover = money - min1 - min2; |
| | | 43 | | |
| | 5 | 44 | | return leftover < 0 ? money : leftover; |
| | 5 | 45 | | } |
| | | 46 | | } |