首页 > itarticle > 088 merge sorted array

088 merge sorted array

admin 1月 11, 2021 0

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.

思路

这一题要搞清楚题意。利用题意给出的条件在原数组中进行操作即可。

class (object):
    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.
        """
        i = m - 1
        j = n - 1
        k = m + n - 1
        while (i >= 0 and j >= 0):
            if (nums1[i] > nums2[j]):
                nums1[k] = nums1[i]
                k -= 1
                i -= 1
            else:
                nums1[k] = nums2[j]
                k -= 1
                j -= 1
        
        while (j >= 0):
            nums1[k] = nums2[j]
            k -= 1
            j -= 1