leetcode 88:Merge Sorted Array
2017-06-29 10:05
302 查看
原题:
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.
题意是两个数组,合并到nums1进行排序。
代码如下: (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);
}
看下性能。。
感觉自己是懒得写排序了。。。 直接调用函数快很多。
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.
题意是两个数组,合并到nums1进行排序。
代码如下: (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);
}
看下性能。。
感觉自己是懒得写排序了。。。 直接调用函数快很多。
相关文章推荐
- LeetCode 88 --- Merge Sorted Array
- leetcode 88: Merge Sorted Array
- LeetCode-88-Merge Sorted Array
- leetcode[88]:Merge Sorted Array
- leetcode-88-Merge Sorted Array
- 【leetcode】【88】Merge Sorted Array
- 【LeetCode】C# 88、Merge Sorted Array
- Leetcode_88_Merge Sorted Array
- [LeetCode-88] Merge Sorted Array(合并有序数组)
- LeetCode88 Merge Sorted Array 解题报告
- leetcode88:Merge Sorted Array
- <LeetCode OJ> Merge Sorted Array【88】
- LeetCode 88:Merge Sorted Array
- Leetcode 88 Merge Sorted Array
- [LeetCode]88 Merge Sorted Array
- leetcode 88 ——Merge Sorted Array
- leetcode88~Merge Sorted Array
- LeetCode@Array_88_MergeSortedArray
- LeetCode(88)Merge Sorted Array
- [LeetCode]88 Merge Sorted Array