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.
首先想到的是使用计数排序,记录下每个整数出现的次数,然后对数组重新赋值。但是使用需要额外空间O(n)。
计数排序算法请参考
http://puffsun.iteye.com/blog/1294547
题目要求使用常数个额外空间,一次遍历:遍历过程中,将整个数组看成三块,使用两指针分别记录0和2块位置,遇上0就交换到数组前部,2交换到数组后部,剩下的1就在数组中间了。
public class ColorSort {
public void swap(int [] A,int k,int m){
int tmp=A[k];
A[k]=A[m];
A[m]=tmp;
}
public void sorted(int [] A){
int len=A.length;
int p0=0;
int p2=len-1;
int i=0;
while(i<=p2){
switch(A[i]){
case 0:
if(i!=p0){
swap(A,i,p0);
}
p0++;
i++;
break;
case 1:
i++;
break;
case 2:
if(i!=p2){
swap(A,i,p2);
p2--;
}else{
i++;
}
break;
} //switch
}//while
}
}