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.
从后往前合并就不必重新开辟空间了,时间复杂度O(m+n)
/***
* Leetcode online Runtim : 4ms
* last edited date:2015-10-12
* .cpp
**/
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int i = m + n - 1;
if (!(m--)) {
nums1 = nums2;
return;
}
if (!(n--)) return;
while (i >= 0){
nums1[i--] = (nums1[m] > nums2[n]) ?
nums1[m--] : nums2[n--];
//当nums1结束了,则将nums2剩余的序列填入
if (m < 0) {
while (i >= 0){
nums1[i--] = nums2[n--];
}
break;
}
//若nums2提前结束,则退出循环
else if (n < 0) break;
}
}
};