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?

//my two-pass algorithm
public class Solution {
    public void sortColors(int[] A) {
        int red=0,white=0,blue=0;
        for(int i=0;i<A.length;i++){
            switch(A[i]){
                case 0:red++;
                    break;
                case 1:white++;
                    break;
                case 2:blue++;
                    break;
            }
        }
        for(int i=0;i<A.length;i++){
            if(i<red){
                A[i]=0;
            }else if(i<red+white){
                A[i]=1;
            }else{
                A[i]=2;
            }
        }
    }
}

设i,k分别为红白,白蓝之间的下标,作j=[0,k]循环.

如果是白色,则跳过;

如果是红色,和A[j]互换(A[j]肯定是白色,因为之前被跳过了,或者i==j),然后j++;

如果是蓝色,和A[k]互换,然后k--,j--(不确定A[j]什么颜色);

//one-pass algorithm
public class Solution {
    public void sortColors(int[] A) {
        int i=0,k=A.length-1;
        for(int j=0;j<=k;j++){
            if(A[j]==0){
                //swap(A[j],A[i++]);
                <span style="font-family: 'Helvetica Neue', Helvetica, Arial, sans-serif;">A[j]=A[i];</span>
                A[i++]=0;
            }else if(A[j]==2){
                //swap(A[j--],A[k--]);
                A[j--]=A[k];
                A[k--]=2;
            }
        }
    }
}