| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 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.AbsoluteDifferenceBetweenMaximumAndMinimumKElements; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class AbsoluteDifferenceBetweenMaximumAndMinimumKElementsFrequencyArray : |
| | | 16 | | IAbsoluteDifferenceBetweenMaximumAndMinimumKElements |
| | | 17 | | { |
| | | 18 | | public int AbsDifference(int[] nums, int k) |
| | 2 | 19 | | { |
| | 2 | 20 | | Span<int> numFrequencies = stackalloc int[100]; |
| | | 21 | | |
| | 14 | 22 | | for (var i = 0; i < nums.Length; i++) |
| | 5 | 23 | | { |
| | 5 | 24 | | var num = nums[i]; |
| | | 25 | | |
| | 5 | 26 | | numFrequencies[num - 1]++; |
| | 5 | 27 | | } |
| | | 28 | | |
| | 2 | 29 | | var result = 0; |
| | | 30 | | |
| | 2 | 31 | | var remainingCount = k; |
| | | 32 | | |
| | 204 | 33 | | for (var i = 0; i < numFrequencies.Length; i++) |
| | 102 | 34 | | { |
| | 102 | 35 | | var count = Math.Min(numFrequencies[i], remainingCount); |
| | | 36 | | |
| | 102 | 37 | | result += (i + 1) * count; |
| | | 38 | | |
| | 102 | 39 | | remainingCount -= count; |
| | | 40 | | |
| | 102 | 41 | | if (remainingCount == 0) |
| | 2 | 42 | | { |
| | 2 | 43 | | break; |
| | | 44 | | } |
| | 100 | 45 | | } |
| | | 46 | | |
| | 2 | 47 | | remainingCount = k; |
| | | 48 | | |
| | 196 | 49 | | for (var i = numFrequencies.Length - 1; i >= 0; i--) |
| | 98 | 50 | | { |
| | 98 | 51 | | var count = Math.Min(numFrequencies[i], remainingCount); |
| | | 52 | | |
| | 98 | 53 | | result -= (i + 1) * count; |
| | | 54 | | |
| | 98 | 55 | | remainingCount -= count; |
| | | 56 | | |
| | 98 | 57 | | if (remainingCount == 0) |
| | 2 | 58 | | { |
| | 2 | 59 | | break; |
| | | 60 | | } |
| | 96 | 61 | | } |
| | | 62 | | |
| | 2 | 63 | | return Math.Abs(result); |
| | 2 | 64 | | } |
| | | 65 | | } |