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+m所以可以从结尾开始填充从而避免插入带来的开销,两指针同时遍历,注意边界条件
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int i=m-1,j=n-1,tar=n+m-1;
while(j>=0)
{
nums1[tar--]=nums1[i]>nums2[j]&&i>=0?nums1[i--]:nums2[j--];
}
}