原题:
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.
代码如下: (C)
void merge(int* nums1, int m, int* nums2, int n) {
for(int k=0 ; k<n ; k++)
{
*(nums1+m+k)=*(nums2+k);
}
int cmp(const void *a,const void *b)
{
return *(int *)a-*(int *)b;
}
qsort(nums1,m+n,sizeof(int),cmp);
}
看下性能。。
感觉自己是懒得写排序了。。。 直接调用函数快很多。