[勇者闯LeetCode] 88. Merge Sorted Array

[勇者闯LeetCode] 88. 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.

Information

Tags: Array | Two Pointers

Difficulty: Easy

Solution

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

n -= 1
p -= 1