2526272829303132333435363738394041424344454647484950515253545556

from typing import List

class Solution:
    # Function to merge two sorted arrays nums1 and nums2
   def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
        # Declare a 3rd array and 2 pointers:
        merged = [0] * (m + n)
        left = 0
        right = 0
        index = 0

        """ Insert elements from nums1 and nums2 into
        merged array using left and right pointers """
        while left < m and right < n:
            if nums1[left] <= nums2[right]:
                merged[index] = nums1[left]
                left += 1
            else:
                merged[index] = nums2[right]
                right += 1
            index += 1

        # If right pointer reaches the end of nums2:
        while left < m:
            merged[index] = nums1[left]
            left += 1
            index += 1

        # If left pointer reaches the end of nums1:
        while right < n:
            merged[index] = nums2[right]
            right += 1
            index += 1

        """ Copy elements from merged array
        array back to nums1 """
        for i in range(m + n):
            nums1[i] = merged[i]
            

if __name__ == "__main__":
    nums1 = [-5, -2, 4, 5, 0, 0, 0]
    nums2 = [-3, 1, 8]
    m = 4
    n = 3

    # Create an instance of the Solution class
    sol = Solution()

    sol.merge(nums1, m, nums2, n)

    # Output the merged arrays
    print("The merged arrays is:")
    print("nums1[] =", nums1)

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354

class Solution {
    // Function to merge two sorted arrays nums1 and nums2
    merge(nums1, m, nums2, n) {
        
        // Declare a 3rd array and 2 pointers:
        let merged = new Array(m + n);
        let left = 0;
        let right = 0;
        let index = 0;

        /* Insert elements from nums1 and nums2 into
        merged array using left and right pointers */
        while (left < m && right < n) {
            if (nums1[left] <= nums2[right]) {
                merged[index++] = nums1[left++];
            } else {
                merged[index++] = nums2[right++];
            }
        }

        // If right pointer reaches the end of nums2:
        while (left < m) {
            merged[index++] = nums1[left++];
        }

        // If left pointer reaches the end of nums1:
        while (right < n) {
            merged[index++] = nums2[right++];
        }

        /* Copy elements from merged array
        array back to nums1 and nums2 */
        for (let i = 0; i < m + n; i++) {
            nums1[i]