| | | 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.MergeTwo2DArraysBySummingValues; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MergeTwo2DArraysBySummingValuesTwoPointers : IMergeTwo2DArraysBySummingValues |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n + m) |
| | | 19 | | /// Space complexity - O(n + m) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums1"></param> |
| | | 22 | | /// <param name="nums2"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int[][] MergeArrays(int[][] nums1, int[][] nums2) |
| | 2 | 25 | | { |
| | 2 | 26 | | var result = new List<int[]>(); |
| | | 27 | | |
| | 2 | 28 | | var nums1Index = 0; |
| | 2 | 29 | | var nums2Index = 0; |
| | | 30 | | |
| | 10 | 31 | | while (nums1Index < nums1.Length && nums2Index < nums2.Length) |
| | 8 | 32 | | { |
| | 8 | 33 | | if (nums1[nums1Index][0] == nums2[nums2Index][0]) |
| | 2 | 34 | | { |
| | 2 | 35 | | result.Add([nums1[nums1Index][0], nums1[nums1Index][1] + nums2[nums2Index][1]]); |
| | | 36 | | |
| | 2 | 37 | | nums1Index++; |
| | 2 | 38 | | nums2Index++; |
| | 2 | 39 | | } |
| | 6 | 40 | | else if (nums1[nums1Index][0] < nums2[nums2Index][0]) |
| | 3 | 41 | | { |
| | 3 | 42 | | result.Add(nums1[nums1Index]); |
| | | 43 | | |
| | 3 | 44 | | nums1Index++; |
| | 3 | 45 | | } |
| | | 46 | | else |
| | 3 | 47 | | { |
| | 3 | 48 | | result.Add(nums2[nums2Index]); |
| | | 49 | | |
| | 3 | 50 | | nums2Index++; |
| | 3 | 51 | | } |
| | 8 | 52 | | } |
| | | 53 | | |
| | 3 | 54 | | while (nums1Index < nums1.Length) |
| | 1 | 55 | | { |
| | 1 | 56 | | result.Add(nums1[nums1Index++]); |
| | 1 | 57 | | } |
| | | 58 | | |
| | 2 | 59 | | while (nums2Index < nums2.Length) |
| | 0 | 60 | | { |
| | 0 | 61 | | result.Add(nums2[nums2Index++]); |
| | 0 | 62 | | } |
| | | 63 | | |
| | 2 | 64 | | return result.ToArray(); |
| | 2 | 65 | | } |
| | | 66 | | } |