lintcode之Merge Sorted Array
2014-12-03 15:37
267 查看
Merge two given sorted integer array A and B into a new sorted integer array.
样例
A=[1,2,3,4]
B=[2,4,5,6]
return [1,2,2,3,4,4,5,6]
思路很简单,就是将两个数组中的数移动到一个数组中进行排序,如有更好的方法,请在下面回帖,谢谢指点!!
代码如下:
耗时:13ms
样例
A=[1,2,3,4]
B=[2,4,5,6]
return [1,2,2,3,4,4,5,6]
思路很简单,就是将两个数组中的数移动到一个数组中进行排序,如有更好的方法,请在下面回帖,谢谢指点!!
代码如下:
class Solution { public: /** * @param A and B: sorted integer array A and B. * @return: A new sorted integer array */ vector<int> mergeSortedArray(vector<int> &A, vector<int> &B) { // write your code here int max = A.size() + B.size(); int a[max]; int temp; int i,j; for(i = 0; i < A.size(); i++) { a[i] = A[i]; } for(i = A.size(),j = 0; i < max; i++,j++) { a[i] = B[j]; } for(i = 0; i < max; i++) { for(j = max - 1; j > i; j--) { if(a[j] < a[j-1]) { temp = a[j]; a[j] = a[j-1]; a[j-1] = temp; } } } vector<int> C(a,a+max); return C; } };
耗时:13ms
相关文章推荐
- Lintcode: Merge Sorted Array II
- LintCode Merge Sorted Array 合并排序数组
- LintCode Merge Sorted ArrayII 合并排序数组 II
- LintCode Merge Sorted Array II
- lintcode:Merge Sorted Array
- lintcode:Find Minimum in Rotated Sorted Array
- Google/LintCode:H-Median of two Sorted Array
- lintcode convert-sorted-array-to-binary-search-tree-with-minimal-height 把排序数组转换为高度最小的二叉搜索树
- merge-sorted-array Java code
- Lintcode Recover Rotated Sorted Array
- Lintcode: Recover Rotated Sorted Array
- [leet code] Merge Sorted Array
- lintcode merge-k-sorted-lists 合并k个排序链表
- lintcode-medium-Search in Rotated Sorted Array II
- lintcode 中等题:search in rotated sorted arrayII 搜索旋转排序数组II
- lintcode:Merge Two Sorted Lists
- lintcode-medium-Find Minimum in Rotated Sorted Array
- (lleetcode)Merge Sorted Array
- LintCode 104:Merge k Sorted Lists
- LintCode Remove Duplicates from Sorted Array II 删除排序数组中的重复数字 II