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.
因为有序,若从开始插入则nums1改变太多,所以选择比较最后两个大小,大的放在最后,一直比较到其中一个遍历完,复杂度为n
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
for(int i=m+n-1;i>=0;i--){
if(n==0)
return;
if(m==0){
for(int i=0;i<n;i++)
nums1[i]=nums2[i];
return;
}
if(nums1[m-1]>nums2[n-1]){
nums1[i]=nums1[m-1];
m--;
}
else{
nums1[i]=nums2[n-1];
n--;
}
}
}
};