Merge Sorted Array
Total Accepted: 80108 Total Submissions: 271926 Difficulty: Easy
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
思路:
因为空间足够大,所以,从数组最后从大到小开始排即可。
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int index=m+n-1;
m--;
n--;
while(m>=0&&n>=0){
if(nums1[m]>nums2[n]){
nums1[index--]=nums1[m--];
}else{
nums1[index--]=nums2[n--];
}
}
while(n>=0){
nums1[index--]=nums2[n--];
}
}
};