| | | 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.FinalArrayStateAfterKMultiplicationOperations; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class FinalArrayStateAfterKMultiplicationOperationsPriorityQueue : IFinalArrayStateAfterKMultiplicationOperations |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n + k log n) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <param name="k"></param> |
| | | 23 | | /// <param name="multiplier"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public int[] GetFinalState(int[] nums, int k, int multiplier) |
| | 2 | 26 | | { |
| | 2 | 27 | | var numsPriorityQueue = new PriorityQueue<(int Value, int Index), (int Value, int Index)>(); |
| | | 28 | | |
| | 18 | 29 | | for (var i = 0; i < nums.Length; i++) |
| | 7 | 30 | | { |
| | 7 | 31 | | numsPriorityQueue.Enqueue((nums[i], i), (nums[i], i)); |
| | 7 | 32 | | } |
| | | 33 | | |
| | 20 | 34 | | for (var i = 0; i < k; i++) |
| | 8 | 35 | | { |
| | 8 | 36 | | var num = numsPriorityQueue.Dequeue(); |
| | | 37 | | |
| | 8 | 38 | | num.Value *= multiplier; |
| | | 39 | | |
| | 8 | 40 | | numsPriorityQueue.Enqueue((num.Value, num.Index), (num.Value, num.Index)); |
| | 8 | 41 | | } |
| | | 42 | | |
| | 9 | 43 | | while (numsPriorityQueue.Count > 0) |
| | 7 | 44 | | { |
| | 7 | 45 | | var num = numsPriorityQueue.Dequeue(); |
| | | 46 | | |
| | 7 | 47 | | nums[num.Index] = num.Value; |
| | 7 | 48 | | } |
| | | 49 | | |
| | 2 | 50 | | return nums; |
| | 2 | 51 | | } |
| | | 52 | | } |