首页 > 代码库 > Sort Colors
Sort Colors
题目：
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）算法思想：
顺序遍历一次即可：设一个i,当A[i]==0时，A[i++]与A[low++]交换；当A[i]==2时，A[i]与A[high--]交换；否则i++。
（2）代码如下：
Sort Colors