https://oj.leetcode.com/problems/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.
public void sortColors(int[] A)
两种做法。第一种简单,counting sort。就是数有多少个0,1,2然后扫第二遍的时候再重写一遍数组
第二种就很有名堂了,先说一下具体做法,分三种指针,头,中间,尾各一个。分别代表0,1,2的位置,我们命名为zero, one, two 好了,zero和one的初始位置都是数组的开头,这就是一个基于swap的算法,当A[one]是0的时候,A[one]和A[zero]交换,然后one, zero前进一步,当A[one] = 1的时候继续前进,当A[one] = 2的时候。A[one]和A[two]交换,two--。不停循环这个过程直到one和two相遇并超越了two。
这个算法其实很有名,叫Dutch Flag。属于一种unstable sort,也就是只负责进行归类性质的排序,但并不负责同样类别的排序。
给出Wiki的地址吧:
http://en.wikipedia.org/wiki/Dutch_national_flag_problem
给出代码如下:
public void sortColors(int[] A) {
int head = 0, mid = 0, tail = A.length - 1;
while(mid <= tail){
if(A[mid] == 1)
mid++;
else if(A[mid] == 0){
int tmp = A[head];
A[head] = A[mid];
A[mid] = tmp;
head++;
mid++;
}else{
int tmp = A[tail];
A[tail] = A[mid];
A[mid] = tmp;
tail--;
}
}
}