| | | 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.RemoveDuplicatesFromSortedArray2; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class RemoveDuplicatesFromSortedArray2Dictionary : IRemoveDuplicatesFromSortedArray2 |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n^2) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int RemoveDuplicates(int[] nums) |
| | 2 | 24 | | { |
| | 2 | 25 | | var numsDictionary = new Dictionary<int, int>(); |
| | | 26 | | |
| | 2 | 27 | | var left = 0; |
| | 2 | 28 | | var right = nums.Length; |
| | | 29 | | |
| | 17 | 30 | | while (left < right) |
| | 15 | 31 | | { |
| | 15 | 32 | | if (numsDictionary.TryAdd(nums[left], 1)) |
| | 7 | 33 | | { |
| | 7 | 34 | | left++; |
| | | 35 | | |
| | 7 | 36 | | continue; |
| | | 37 | | } |
| | | 38 | | |
| | 8 | 39 | | if (numsDictionary[nums[left]] < 2) |
| | 5 | 40 | | { |
| | 5 | 41 | | numsDictionary[nums[left]]++; |
| | | 42 | | |
| | 5 | 43 | | left++; |
| | 5 | 44 | | } |
| | | 45 | | else |
| | 3 | 46 | | { |
| | 26 | 47 | | for (var j = left; j < right - 1; j++) |
| | 10 | 48 | | { |
| | 10 | 49 | | (nums[j], nums[j + 1]) = (nums[j + 1], nums[j]); |
| | 10 | 50 | | } |
| | | 51 | | |
| | 3 | 52 | | right--; |
| | 3 | 53 | | } |
| | 8 | 54 | | } |
| | | 55 | | |
| | 2 | 56 | | return right; |
| | 2 | 57 | | } |
| | | 58 | | } |