<jupyter_start><jupyter_text>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.Example:    Input:    nums1 = [1,2,3,0,0,0], m = 3    nums2 = [2,5,6],       n = 3    Output: [1,2,2,3,5,6]<jupyter_code>class Solution:
    def merge(self, nums1, m, nums2, n):
        '''
        nums1: List[int]
        m: int
        nums2: List[int]
        n: int
        '''
        
        """
        Do not return anything, modify nums1 in-place instead.
        """
        i,j,k = m-1,n-1,m+n-1
        while i >= 0 and j >= 0:
            if nums1[i] <= nums2[j]:
                nums1[k] = nums2[j]
                k -= 1
                j -= 1
            else:
                nums1[k] = nums1[i]
                k -= 1
                i -= 1
        while j >= 0:
            nums1[k] = nums2[j]
            k -= 1
            j -= 1
            
        return nums1
# test
a =[1,2,3,0,0,0]
m = 3
b = [2,5,6]
n = 3
Solution().merge(a,m,b,n)<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.12489728841413311, 'fraction_numerical': 0.05258833196384552, 'mean_word_length': 1.5588235294117647, 'pattern_counts': {'":': 0, '<': 6, '<?xml version=': 0, '>': 8, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '1', 'dir': 'jupyter-structured-clean-dedup', 'id': '154583', 'license': 'MIT', 'n_tokens_mistral': 466, 'n_tokens_neox': 443, 'n_words': 130, 'path': 'DSA/arrays/merge.ipynb', 'repo_name': 'lance-lh/Data-Structures-and-Algorithms', 'size': '1217'}