Skip to content

88. Merge Sorted Array

难度: Easy

刷题内容

原题连接

  • https://leetcode.com/problems/merge-sorted-array

内容描述

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]

解题方案

思路 1

给的数组可能是这样的

  • nums1 : [0]
  • m : 0
  • nums2 : [1]
  • n : 1

所以要判断m和n是不是仍然大于0, 但是m不需要了,因为我们本来就是要在nums1的基础上改,m如果还大于0的话我们不需要改nums1了,保留不变即可

AC代码

class Solution:
    def merge(self, nums1, m, nums2, n):
        """
        :type nums1: List[int]
        :type m: int
        :type nums2: List[int]
        :type n: int
        :rtype: void Do not return anything, modify nums1 in-place instead.
        """
        while m > 0 and n > 0:
            if nums1[m-1] > nums2[n-1]:
                nums1[m+n-1] = nums1[m-1]
                m -= 1
            else:
                nums1[m+n-1] = nums2[n-1]
                n -= 1
        if n > 0:
            nums1[:n] = nums2[:n]


回到顶部