| | | 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.MaximizeSumOfAtMostKDistinctElements; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class MaximizeSumOfAtMostKDistinctElementsSorting : IMaximizeSumOfAtMostKDistinctElements |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n log n), where n is the length of nums array |
| | | 19 | | /// Space complexity - O(k) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <param name="k"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int[] MaxKDistinct(int[] nums, int k) |
| | 3 | 25 | | { |
| | 30 | 26 | | Array.Sort(nums, (a, b) => b.CompareTo(a)); |
| | | 27 | | |
| | 3 | 28 | | Span<int> temp = stackalloc int[k]; |
| | | 29 | | |
| | 3 | 30 | | var count = 0; |
| | | 31 | | |
| | 3 | 32 | | temp[count++] = nums[0]; |
| | | 33 | | |
| | 26 | 34 | | for (var i = 1; i < nums.Length && count < k; i++) |
| | 10 | 35 | | { |
| | 10 | 36 | | if (nums[i] == nums[i - 1]) |
| | 5 | 37 | | { |
| | 5 | 38 | | continue; |
| | | 39 | | } |
| | | 40 | | |
| | 5 | 41 | | temp[count++] = nums[i]; |
| | 5 | 42 | | } |
| | | 43 | | |
| | 3 | 44 | | var result = new int[count]; |
| | | 45 | | |
| | 22 | 46 | | for (var i = 0; i < result.Length; i++) |
| | 8 | 47 | | { |
| | 8 | 48 | | result[i] = temp[i]; |
| | 8 | 49 | | } |
| | | 50 | | |
| | 3 | 51 | | return result; |
| | 3 | 52 | | } |
| | | 53 | | } |