088-merge-sorted-array.py

"""
Problem Link: 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:
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]
"""
classSolution(object):
defmerge(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.
 """
m-=1
n-=1
l=m+n+1
whilem>=0andn>=0:
ifnums1[m] <nums2[n]:
nums1[l] =nums2[n]
n-=1
else:
nums1[l] =nums1[m]
m-=1
l-=1
whilen>=0:
nums1[l] =nums2[n]
n-=1
l-=1