[leetcode] Sort Colors
来源:互联网 发布:java 断点续传 编辑:程序博客网 时间:2024/06/07 00:36
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.
Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.
Note:
You are not suppose to use the library's sort function for this problem.
click to show follow up.
Follow up:
A rather straight forward solution is a two-pass algorithm using counting sort.
First, iterate the array counting number of 0's, 1's, and 2's, then overwrite array with total number of 0's, then 1's and followed by 2's.
Could you come up with an one-pass algorithm using only constant space?
思路:将1和2不断的往后交换最终达到有序,参考链接http://www.cnblogs.com/remlostime/archive/2012/11/25/2787739.html
代码:
class Solution {public: void sortColors(int A[], int n) { int i=0,j=n-1,k=n-1; while(i<=j){ if(A[i]==2){ int temp=A[k]; A[k]=A[i]; A[i]=temp; k--; if(k<j) j=k; } else if(A[i]==1){ int temp=A[j]; A[j]=A[i]; A[i]=temp; j--; } else i++; } }};
- LeetCode: Sort Colors
- LeetCode Sort Colors
- LeetCode : Sort Colors
- leetcode 77: Sort Colors
- Leetcode 75 Sort Colors
- leetcode 101: Sort Colors
- [LeetCode]Sort Colors
- [leetcode]Sort Colors
- LeetCode-Sort Colors
- [leetcode] Sort Colors
- [LeetCode] Sort Colors
- [leetCode] Sort Colors
- LeetCode - Sort Colors
- leetcode:Sort Colors
- LeetCode | Sort Colors
- 【LeetCode】Sort Colors
- Leetcode: Sort Colors
- [LeetCode] Sort Colors
- 最短路径Ⅲ—Floyd-Warshall算法
- Oracle同义词创建及其作用
- Android UI 设计之 TextView EditText 组件属性方法最详细解析
- setValue:forUndefinedKey:]: this class is not key value coding-compliant for the key
- 模拟按键
- [leetcode] Sort Colors
- Ubuntu init启动流程分析
- ORA-08104: this index object xxxxx is being online built or rebuilt
- HDU4893 Wow! Such Sequence! 多校练习赛 树状数组
- 【No4.】对图片的压缩质量、压缩尺寸、读流压缩、方法介绍
- 位运算技巧
- 算术表达式求值
- 获取访问者ip的方法
- android ListView详解