题目:
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 nums1and nums2 are m and n respectively.
思路:
从最后一个元素开始比较,将较大的放到对应位置。
时间复杂度:O(m+n)
空间复杂度:O(1)
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
if (n == 0) return;
int count = m + n - 1;
n--;
if (m == 0)
{
while (n >= 0) nums1[count--] = nums2[n--];
return;
}
m--;
while (m >= 0 && n>=0)
{
nums1[count--] = nums1[m] < nums2[n] ? nums2[n--] : nums1[m--];
}
if (m == 0) return;
while (n >= 0) nums1[count--] = nums2[n--];
}
};