Force buckle 88 Merge two ordered arrays

88. Merge two ordered arrays

Here are two buttons Non decreasing order Array of arranged integers nums1 and nums2, There are two other integers m and n , respectively nums1 and nums2 The number of elements in .

Would you please Merge nums2 To nums1 in , Make the merged array press Non decreasing order array .

Be careful ： Final , The merged array should not be returned by the function , It's stored in an array nums1 in . In response to this situation ,nums1 The initial length of is m + n, The top m Elements represent the elements that should be merged , after n Elements are 0 , It should be ignored .nums2 The length of is n .

Example 1：

Input ：nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
Output ：[1,2,2,3,5,6]
explain ： Need merger [1,2,3] and [2,5,6] .
The combined result is [1,2,2,3,5,6] , In which, bold italics indicates nums1 The elements in

Ideas

a = [1,2,3,4,7,5,6]
b = ['a','b']
c = ['h',12,'c']
a.extend(b)
a.extend(c)
print(a)
 
# result ：[1, 2, 3, 4, 7, 5, 6, 'a', 'b', 'h', 12, 'c']

from numpy import array
 
a = [1,2,3]
b = ['a','b','c']
c = ['h',12,'k']
e = [a,b,c]
e = array(e)
print(e.flatten())
 
# result ：['1' '2' '3' 'a' 'b' 'c' 'h' '12' 'k']

a = [1,2,3,4]  # The number of elements is different 
b = ['a','b','c']
c = ['h',12,'k']
e = [a,b,c]
e = array(e)
print(e.flatten())
 
# result ：[list([1, 2, 3, 4]) list(['a', 'b', 'c']) list(['h', 12, 'k'])]

The merging process of arrays

Code section

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. """
        nums1[m:] = nums2
        nums1.sort()
        return nums1