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.
//将nums2中的元素插入nums1中,从后往前比较,这样就不会产生需要数据后移的问题了
//只要nums2中所有元素都插入到nums1中,那么nums1中剩下的元素保持原来的位置,不用移动。
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int i = m - 1, j = n - 1, k = m + n - 1;
while (j >= 0)
{
nums1[k--] = i >= 0 && nums1[i] > nums2[j] ? nums1[i--] : nums2[j--];
//若nums1[i]>nums2[j],则nums[k]=nums1[i],同时i自减1, j不变,下一次nums[j]与nums1[i-1]相比较
}
}
};