Merge ordered sequence

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

source ： Power button （LeetCode）
link ：https://leetcode-cn.com/problems/merge-sorted-array
Copyright belongs to the network . For commercial reprint, please contact the official authority , Non-commercial reprint please indicate the source .

Knowledge point ;
Array ：
Advanced features of lists , section
Personal thinking ：

1. Delete nums1 Array 0 Elements
2. add to nums2 Elements in to nums1 in
3. nums1 call sort Method to sort the new array
   In the delete 0 In the process of element ,nums1 Last of 0 The element has never been deleted

class Solution(object):
    def merge(self, nums1, m, nums2, n):
        """ :type nums1: List[int] :type m: int :type nums2: List[int] :type n: int :rtype: None Do not return anything, modify nums1 in-place instead. """
        # nums1[m:] = nums2
        # nums1.sort()
        # print nums1
        for i in range(n):
            nums1.append(nums2[i])
        print nums1
        l = len(nums1)
        print l
        for i in range(l):
            print (i, nums1[i])
            if nums1[i] == 0:
                nums1.pop(i)
        nums1.sort()

Solution 1 ：

Use the advanced features of functions ： List slice

class Solution(object):
    def merge(self, nums1, m, nums2, n):
        """ :type nums1: List[int] :type m: int :type nums2: List[int] :type n: int :rtype: None Do not return anything, modify nums1 in-place instead. """
        nums1[m:]=nums2
        nums1.sort()

Direct merger ：nums1 and nums2
m Express nums1 Middle Africa 0 Number of elements
n Express nums2 Middle Africa 0 Number of elements
take nums1 in m Post position 0 Element direct use nums2 Element replacement in
Time complexity ： The time complexity can be calculated according to the quick sorting