Sort Colors (Java)

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.

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?

一次遍历并且使用空间复杂度为常数级的方法就是遍历时先把该位置2，设两个指针，如果该位为0，就在其中一个指针位写0（写1的指针位也跟着写0的跑才可以），如果该位为1，则在另一个指针位写1。

就相当于先全刷成2，再部分刷成1，再部分刷成0。

22222222

11111

00

Source  two-pass

public class Solution {
	public void sortColors(int[] A) {
        int zn = 0, on = 0;
    	for(int i = 0; i < A.length; i++){
        	if(A[i] == 0) zn ++;
        	if(A[i] == 1) on ++;
        
        }
    
    	for(int i = 0; i < A.length; i++){
    		if(i < zn) A[i] = 0;
    		if(i >= zn && i < (zn + on)) A[i] = 1;
    		if(i >= (zn + on)) A[i] = 2;
    	}
    }
}

Test

    public static void main(String[] args){
    	int[] A = {1, 0};
    	new Solution().sortColors(A);  
    	for(int i = 0; i < A.length; i++){
    		System.out.println(A[i]);
    	}
    }

Source one-pass

public class Solution {
	public void sortColors(int[] A) {
        int p = 0, q = 0;
        for(int i = 0; i < A.length; i++){
        	int temp = A[i];   //temp先记录下A的值
        	A[i] = 2;
        	if(temp == 0){
        		A[q++] = 1;
        		A[p++] = 0;
        	}
        	else if(temp == 1){
        		A[q++] = 1;
        	}
        }
    }

}