88. Merge Sorted Array
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.
題目的意思就是合併兩個排序好的數組,因爲題目假定有足夠的空間,所以我們就直接使用,而不需要再去申請更多的空間。我覺得這段代碼最厲害的地方就是以-1爲循環的跳出,然後用+1來補足。
代碼:
void merge(int* nums1, int m, int* nums2, int n) {
int i=m-1;
int j=n-1;
while(i>=0&&j>=0){
if(nums1[i]>nums2[j]){
nums1[i+j+1]=nums1[i];
i--;
}else{
nums1[i+j+1]=nums2[j];
j--;
}
}
while(j>=0){
nums1[i+j+1]=nums2[j];
j--;
}
}