Given two sorted integer arrays nums1 and nums2, merge nums2 into 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]
方法1:从后往前处理
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int cur1=m-1,cur2=n-1;
if(n==0) return;
for(int i=n+m-1;i>=0;i--){
if(cur2<0)return;
if(cur1<0){
while(cur2>=0){
nums1[cur2]=nums2[cur2];
cur2--;
}
return;
}
if(nums1[cur1]>=nums2[cur2]){
nums1[i]=nums1[cur1];
cur1--;
}else{
nums1[i]=nums2[cur2];
cur2--;
}
}
}
};