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]
把两个排序好的数组合并。
discuss的思路基本都是倒着排,两个数组都是从后向前遍历寻找最大的数然后插入第一个数组。
分享一个一行的代码rumtime 7ms
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
while(n>0) nums1[m+n-1] = (m==0||nums2[n-1] > nums1[m-1]) ? nums2[--n] : nums1[--m];
}
};
lz的做法是正向排序,因为涉及到交换,感觉应该时间更长一些,实际上rumtime也就6ms
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int i = 0, j = 0;
if (m == 0)
{
while (j < n)
nums1[m++] = nums2[j++];
}
while (j<n)
{
if (nums1[i]>nums2[j])
{
nums1[m] = nums2[j];
int index = i;
while (index<(m) && nums1[m] <= nums1[index])
{
swap(nums1[m], nums1[index]);
index++;
}
m++;
i++;
j++;
}
else if (i == m - 1)
{
while (j < n)
nums1[m++] = nums2[j++];
break;
}
else
{
i++;
}
}
}
};