问题描述:
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 nrespectively.
- 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]
源码:
就是从尾到头的遍历,想着也没啥时间复杂度,就是O(max(M+N)),结果时间只有7%,空间100%。我抑郁了。最近这leetcode之前100%都跑的贼低。空间咋浪费都是100%。
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int tmp=m+n-1, i, j;
for(i=m-1, j=n-1; i>=0 && j>=0;){
if(nums1[i]>=nums2[j]){
nums1[tmp--] = nums1[i];
i--;
}else{
nums1[tmp--] = nums2[j];
j--;
}
}
if(j>=0){
for(int k=j; k>=0; k--) nums1[tmp--] = nums2[k];
}
}
};
很玄学的事情,Discuss区思想一样的,少了一些变量,结果空间没省下来,时间到了81.45%(其实作者号称100%)
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int left {m - 1};
int right {n - 1};
int mid {m + n - 1};
while (left >= 0 && right >= 0)
nums1[mid--] = (nums1[left] >= nums2[right])? nums1[left--] : nums2[right--];
while (right >= 0) {
nums1[mid--] = nums2[right--];
}
}
};