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.
题意
两个排好序的数组nums1和nums2,将nums2合并到nums1中形成一个排好序的数组nums1。nums1足够大能存储nums1和nums2的元素。
题解
用归并。
取nums1和nums2的元素最大的元素放到nums1的n+m-1下标处,并依次往前走。
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int cur_m=m-1;
int cur_n=n-1;
int cur=m+n-1;
while(cur_m>=0&&cur_n>=0)
{
if(nums1[cur_m]>nums2[cur_n])
nums1[cur--]=nums1[cur_m--];
else nums1[cur--]=nums2[cur_n--];
}
while(cur_n>=0)
nums1[cur--]=nums2[cur_n--];
}
};