一.问题描述
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 nums1 and nums2 are m and n respectively.
二.我的解题思路
合并两个有序的数组,采用的思路类似于归并排序的归并这一步。就是每次比较两个数,寻找当前最大/最小的数,然后放在数组的合适位置。本题适合从最大的数到最小的数这样依次存储,这样就不会有覆盖的问题。测试通过的程序如下:
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int i=m-1;int j=n-1;
int curr=m+n-1;
while( i>=0 && j>=0){
if(nums1[i]>nums2[j]) {nums1[curr]=nums1[i];i--;}
else{nums1[curr]=nums2[j];j--;}
curr--;
}
while(j>=0){
nums1[curr]=nums2[j];
curr--;
j--;
}
}
};