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 nums1and nums2 are m and n respectively.
解题思路:对两个有序的整型数组进行排序,不需要自己分配内存。
代码如下:
class Solution
{
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n)
{
int index=m+n-1;
int n1=m-1;
int n2=n-1;
while(n1>=0&&n2>=0)
{
if(nums1[n1]>=nums2[n2])
{
nums1[index]=nums1[n1];
n1--;
index--;
}
else
{
nums1[index]=nums2[n2];
n2--;
index--;
}
}
while(n1>=0)
{
nums1[index]=nums1[n1];
index--;
n1--;
}
while(n2>=0)
{
nums1[index]=nums2[n2];
index--;
n2--;
}
}
};