LeetCode练题——88. Merge Sorted Array

1、题目

88. Merge Sorted Array——Easy

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]

2、我的解答

 # -*- coding: utf-8 -*-
 # @Time    : 2020/2/16 19:18
 # @Author  : SmartCat0929
 # @Email   : [e-mail]
 # @Link    : https://github.com/SmartCat0929
 # @Site    :
 # @File    : 88. Merge Sorted Array.py
 from typing import List

 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.
         """
         p = m + n - 1
         p1 = m - 1
         p2 = n - 1
         while p1 >= 0 and p2 >= 0:
             if nums2[p2] > nums1[p1]:
                 nums1[p] = nums2[p2]
                 p -= 1
                 p2 -= 1
             else:
                 nums1[p] = nums1[p1]
                 p -= 1
                 p1 -= 1
         while p2 >= 0:
             nums1[p] = nums2[p2]
             p -= 1
             p2 -= 1

 Solution().merge([1, 2, 5, 0, 0, 0], 3, [2, 5, 6], 3)