【Question】
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 innums1 and nums2 are m and n respectively.
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n)
{
vector<int> temp =nums1;
if(m==0) nums1=nums2;
else if(m!=0&&n!=0 )
{
int i,j;
for(i=0,j=0;i<m&&j<n;)
{
if (temp[i]<=nums2[j])
{nums1[i+j]=temp[i];i++;}
else
{nums1[i+j]=nums2[j];j++;}
}
while(i<m)
{
nums1[i+j]=temp[i];i++;
}
while(j<n)
{
nums1[i+j]=nums2[j];j++;
}
}
}
};
方法二:不用额外开辟空间,从后开始往前遍历
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int i = m-1, j = n-1, len = m+n-1;
while ( i>=0 && j>=0 ){
if ( nums1[i]<nums2[j] ){
nums1[len] = nums2[j];len--;j--;
}
else{
nums1[len] = nums1[i];len--;i--;
}
}
while (j>=0) {nums1[len] = nums2[j];len--;j--;
}