---
tags: data_structure_python
---

# Merge Sorted Array <img src="https://img.shields.io/badge/-easy-brightgreen">

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

**Note:**

- The number of elements initialized in nums1 and nums2 are m and n respectively.

- You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.

<ins>**Example:**</ins>

>Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6], n = 3
>
>Output: [1,2,2,3,5,6]

# Solution

class Solution:
    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
        """
        Do not return anything, modify nums1 in-place instead.
        """
        pointer1,pointer2,k = m-1,n-1,m+n-1
        while pointer2>=0:
            if nums1[pointer1]>=nums2[pointer2] and pointer1>=0:
                nums1[k] = nums1[pointer1]
                pointer1-=1
            else:
                nums1[k] = nums2[pointer2]
                pointer2-=1
            k-=1
            print(nums1)