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 Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
if ( n == 0 )
return ;
int length = m+n;
while(m&&n)
{
if(nums1[m-1]>nums2[n-1])
{
nums1[length-1] = nums1[m-1];
m--;
}else
{
nums1[length-1] = nums2[n-1];
n--;
}
length--;
}
while(n)
{
nums1[length-1] = nums2[n-1];
n--;
length--;
}
while(m)
{
nums1[length-1] = nums1[m-1];
m--;
length--;
}
}
};
python:
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.
"""
length = m + n
while m and n :
if nums1[m-1]> nums2[n-1] :
nums1[length-1] = nums1[m-1]
m-=1
else :
nums1[length-1] = nums2[n-1]
n-=1
length-=1
while m :
nums1[length-1] = nums1[m-1]
length-=1
m-=1
while n :
nums1[length-1] = nums2[n-1]
length-=1
n-=1