| | | 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.MergeSortedArray; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MergeSortedArrayThreePointers : IMergeSortedArray |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(m + n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums1"></param> |
| | | 22 | | /// <param name="m"></param> |
| | | 23 | | /// <param name="nums2"></param> |
| | | 24 | | /// <param name="n"></param> |
| | | 25 | | public void Merge(int[] nums1, int m, int[] nums2, int n) |
| | 4 | 26 | | { |
| | 4 | 27 | | var nums1Index = m - 1; |
| | 4 | 28 | | var nums2Index = n - 1; |
| | 4 | 29 | | var k = m + n - 1; |
| | | 30 | | |
| | 8 | 31 | | while (nums1Index >= 0 && nums2Index >= 0) |
| | 4 | 32 | | { |
| | 4 | 33 | | if (nums1[nums1Index] > nums2[nums2Index]) |
| | 1 | 34 | | { |
| | 1 | 35 | | nums1[k] = nums1[nums1Index]; |
| | 1 | 36 | | nums1Index--; |
| | 1 | 37 | | } |
| | | 38 | | else |
| | 3 | 39 | | { |
| | 3 | 40 | | nums1[k] = nums2[nums2Index]; |
| | 3 | 41 | | nums2Index--; |
| | 3 | 42 | | } |
| | | 43 | | |
| | 4 | 44 | | k--; |
| | 4 | 45 | | } |
| | | 46 | | |
| | 10 | 47 | | while (nums2Index >= 0) |
| | 6 | 48 | | { |
| | 6 | 49 | | nums1[k] = nums2[nums2Index]; |
| | 6 | 50 | | nums2Index--; |
| | 6 | 51 | | k--; |
| | 6 | 52 | | } |
| | 4 | 53 | | } |
| | | 54 | | } |