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]
方法一:
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
for (int i=0; i<n; i++)
{
int j;
for (j=0; j<m; j++)
if (nums1[j] > nums2[i]) break;
m ++;
for (int k=m-1; k>=j+1; k--)
nums1[k] = nums1[k-1];
nums1[j] = nums2[i];
}
}
};
方法二:
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
m --;
n --;
while (m >= 0 || n >= 0)
{
if (m < 0) nums1[m+n+1] = nums2[n--];
else if (n < 0) nums1[m+n+1] = nums1[m--];
else
{
if (nums2[n] > nums1[m]) nums1[m+n+1] = nums2[n--];
else nums1[m+n+1] = nums1[m--];
}
}
}
};
方法一是从头开始归并,时间复杂度为O(m*n),空间复杂度为O(m+n),方法二是从尾开始归并,时间复杂度为O(m+n),空间复杂度为O(m+n),方法一相较于方法二,多了位移操作。