(lleetcode)Merge Sorted Array
2015-08-08 20:25
239 查看
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 nums1and nums2 are m and n respectively.
使用快排进行排序:
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 nums1and nums2 are m and n respectively.
使用快排进行排序:
class Solution { public: void quicksort(vector<int>& a,int left,int right) { if(left>right) return; int piv = a[left]; int i = left; int j = right; while(i!=j) { //从右边开始 while(a[j] >= piv && i < j) j--; while(a[i] <= piv && i < j) i++; if(i<j) { /*int t = a[i]; a[i]=a[j]; a[j]=t;*/ swap(a[i],a[j]); } } a[left] = a[i]; a[i] = piv; quicksort(a,left,i-1); quicksort(a,i+1,right); } void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) { int i,j; for(i = m,j=0;i<m+n;++i) { nums1[i] = nums2[j++]; } quicksort(nums1,0,m+n-1); } };
相关文章推荐
- JS中的作用域(scope)
- iSwifting如何发送照片社区
- C语言堆栈入门——堆和栈的区别
- centos文本查看及处理相关的常用命令
- 界面之间传值
- WeChatServer
- UVA 436 Arbitrage (II)【floyd】
- jQuery 的 ready 函数是如何工作的?
- poj 1564 Sum It Up 搜索
- Codeforces Gym 100286I iSharp 水题
- java32至md5加密
- 如何new一个二维数组
- sublime 插件
- **HDU 4281 - Judges' response(DP`背包+TSP)
- POJ1320 Street Numbers(佩尔方程)
- 《计算机程序设计艺术(第一卷)》的问题
- Spark 性能相关参数配置详解-shuffle篇
- java 代理模式
- mysql存储引擎InnoDB插入数据的过程详解
- HDU 1789 Doing Homework again