版权声明:由于一些问题,理论类博客放到了blogger上,希望各位看官莅临指教https://efanbh.blogspot.com/;本文为博主原创文章,转载请注明本文来源 https://blog.csdn.net/wyf826459/article/details/82988039
题目描述:
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]
算法实现:
这个问题比较简单,题目中也没有对空间和时间的要求,最直接的可以直接新建一个数组来进行排序也行。
我们可以利用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;
while(i >= 0 && j >= 0){
if(nums1[i] >= nums2[j]){
nums1[k] = nums1[i];
k --;
i --;
}
else{
nums1[k] = nums2[j];
k --;
j --;
}
}
if(i = -1){
for(int t = 0; t <= j; t ++)
nums1[t] = nums2[t];
}
}
};