| | | 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.MinimumIncrementToMakeArrayUnique; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MinimumIncrementToMakeArrayUniqueSorting : IMinimumIncrementToMakeArrayUnique |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n log n) |
| | | 19 | | /// Space complexity - O(log n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int MinIncrementForUnique(int[] nums) |
| | 6 | 24 | | { |
| | 6 | 25 | | var result = 0; |
| | | 26 | | |
| | 6 | 27 | | Array.Sort(nums); |
| | | 28 | | |
| | 6 | 29 | | var current = -1; |
| | | 30 | | |
| | 106 | 31 | | foreach (var num in nums) |
| | 44 | 32 | | { |
| | 44 | 33 | | if (num > current) |
| | 13 | 34 | | { |
| | 13 | 35 | | current = num; |
| | 13 | 36 | | } |
| | | 37 | | else |
| | 31 | 38 | | { |
| | 31 | 39 | | current += 1; |
| | | 40 | | |
| | 31 | 41 | | result += current - num; |
| | 31 | 42 | | } |
| | 44 | 43 | | } |
| | | 44 | | |
| | 6 | 45 | | return result; |
| | 6 | 46 | | } |
| | | 47 | | } |