moonlightshadow123
6/21/2017 - 8:38 AM

88. Merge Sorted Array

  1. Merge Sorted Array
solution.py
content_copyfile_download
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: void Do not return anything, modify nums1 in-place instead.
        """
        i = m-1
        j = n-1
        while i >= 0 and j >= 0:
            if nums1[i] >= nums2[j]:
                nums1[i+j+1] = nums1[i]
                i -= 1
            else:
                nums1[i+j+1] = nums2[j]
                j -= 1
        while i >= 0:
            nums1[i] = nums1[i]
            i -= 1
        while j >= 0:
            nums1[j] = nums2[j]
            j -= 1
88-Merge-Sorted-Array.md
content_copyfile_download
  • Rendered
  • Source

https://leetcode.com/problems/merge-sorted-array/#/description

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.