两个有序数组合并

    def merge(nums1: List[int], m: int, nums2: List[int], n: int) -> None:
        """
        Do not return anything, modify nums1 in-place instead.
        """
        sort_tuple = []
        nums1_index = 0
        nums2_index = 0
        while  nums1_index < m or nums2_index < n:
            if nums1_index == m:
                sort_tuple.append(nums2[nums2_index])
                nums2_index += 1
            elif nums2_index == n:
                sort_tuple.append(nums1[nums1_index])
                nums1_index += 1
            elif nums1[nums1_index] <= nums2[nums2_index]:
                sort_tuple.append(nums1[nums1_index])
                nums1_index += 1
            else:
                sort_tuple.append(nums2[nums2_index])
                nums2_index += 1
        nums1[:] = sort_tuple