LeetCode 77 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.

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?

分析：

维护三个i，j，k指针，指向0，1，2结束的位置，那么，可以知道，

碰见0，则除了i位置后移1位，存放1和2的两段要整体后移1位；

碰见1，除了j位置后移1位，存放2的一段要整体后移1位；

碰见2，则只有k后移1位。

public class Solution {
    public void sortColors(int[] A) {
        if(A==null || A.length==0) return;
        
        int i=-1, j=-1, k=-1;
        for(int p=0; p<A.length; p++){
            if(A[p] == 0){
                A[++k] = 2;
                A[++j] = 1;
                A[++i] = 0;
            }else if(A[p] == 1){
                A[++k] = 2;
                A[++j] = 1;
            }else if(A[p] == 2){
                A[++k] = 2;
            }
        }
    }
}