| | | 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.SortColors; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class SortColorsCountingSort : ISortColors |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | public void SortColors(int[] nums) |
| | 2 | 23 | | { |
| | 2 | 24 | | var zeroesCount = 0; |
| | 2 | 25 | | var onesCount = 0; |
| | | 26 | | |
| | 24 | 27 | | foreach (var num in nums) |
| | 9 | 28 | | { |
| | 9 | 29 | | switch (num) |
| | | 30 | | { |
| | | 31 | | case 0: |
| | 3 | 32 | | zeroesCount++; |
| | 3 | 33 | | break; |
| | | 34 | | case 1: |
| | 3 | 35 | | onesCount++; |
| | 3 | 36 | | break; |
| | | 37 | | } |
| | 9 | 38 | | } |
| | | 39 | | |
| | 10 | 40 | | for (var i = 0; i < zeroesCount; i++) |
| | 3 | 41 | | { |
| | 3 | 42 | | nums[i] = 0; |
| | 3 | 43 | | } |
| | | 44 | | |
| | 10 | 45 | | for (var i = zeroesCount; i < zeroesCount + onesCount; i++) |
| | 3 | 46 | | { |
| | 3 | 47 | | nums[i] = 1; |
| | 3 | 48 | | } |
| | | 49 | | |
| | 10 | 50 | | for (var i = zeroesCount + onesCount; i < nums.Length; i++) |
| | 3 | 51 | | { |
| | 3 | 52 | | nums[i] = 2; |
| | 3 | 53 | | } |
| | 2 | 54 | | } |
| | | 55 | | } |