88. Merge Sorted Array
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]
题目链接:https://leetcode.com/problems/merge-sorted-array/
题简单,练实现。
法一:开新空间
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
vector<int> res(m+n);
int k = 0,i = 0, j = 0;
for(; i<m && j<n;){
if(nums1[i]<nums2[j]){
res[k++] = nums1[i++];
}else{
res[k++] = nums2[j++];
}
}
while(i<m){
res[k++] = nums1[i++];
}
while(j<n){
res[k++] = nums2[j++];
}
nums1 = res;
}
};
注意:for循环的判断条件里,逗号是或的含义。
法二:in-place
因为nums1是足够长的,所以直接从后向前比,能把数据往nums1空余的地方填。
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;
for(; i>=0 && j>=0;){
if(nums1[i]<nums2[j]){
nums1[k--] = nums2[j--];
}else{
nums1[k--] = nums1[i--];
}
}
while(j>=0){
nums1[k--] = nums2[j--];
}
}
};