Given two sorted integer arrays nums1 and nums2, merge nums2into nums1 as one sorted array.
Note:
- The number of elements initialized in nums1 and nums2 are m and n respectively.
- You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.
Example:
Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int i=0,j=0;
if(!m){
nums1=nums2;
}
else{
for(;j<n;){
if(nums2[j]<nums1[i]){
nums1.insert(nums1.begin()+i,nums2[j]);
i++;j++;
}
else if(nums2[j]>=nums1[i]){
if(i==m+j-1){
i++;
while(j<n){
nums1[i++]=nums2[j++];
}
}
else if(nums2[j]<nums1[i+1]){
nums1.insert(nums1.begin()+i+1,nums2[j]);
i++;j++;
}
else{
i++;
}
}
}
while(nums1.size()!=(m+n)){
nums1.pop_back();
}
}
}
};
看了别人的代码,从后往前。。。
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int index = m + n - 1;
int aindex = m - 1;
int bindex = n - 1;
while(aindex >= 0 && bindex >= 0) {
if(nums1[aindex] > nums2[bindex]) {
nums1[index--] = nums1[aindex--];
} else {
nums1[index--] = nums2[bindex--];
}
}
while(bindex >= 0) {
nums1[index--] = nums2[bindex--];
}
}
};