题目描述:
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]
思路:两个数组从小到大排序,我们可以转变一下思路,让它从大到小排序,并都合并到nums1,这样就不用开新的数组。
代码:
void merge(int* nums1, int m, int* nums2, int n) {
while(m>0 && n>0){
if(nums1[m-1] > nums2[n-1]){
nums1[n+m-1] = nums1[m-1];
m--;
}
else{
nums1[n+m-1] = nums2[n-1];
n--;
}
}
while(n > 0){
nums1[n+m-1] = nums2[n-1];
n--;
}
}