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