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.使用two pointers,借助一个数组完成合并,T:O(N+M),S:O(M)。
参考代码:
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
vector<int> t(m);
for(int i=0;i<m;i++) t[i]=nums1[i];
int i=0,j=0,k=0;
while(i<m&&j<n){
if(t[i]<=nums2[j]) nums1[k++]=t[i++];
else nums1[k++]=nums2[j++];
}
while(i<m) nums1[k++]=t[i++];
while(j<n) nums1[k++]=nums2[j++];
}
};
优化:
1。从右至左归并,S:O(1)。
参考代码:
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(i>=0&&j>=0){
if(nums1[i]>=nums2[j]) nums1[k--]=nums1[i--];
else nums1[k--]=nums2[j--];
}
while(j>=0) nums1[k--]=nums2[j--];
}
};