LeetCode OJ算法题（七十五）：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.

click to show follow up.

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?

解法：

题目要求对元素全是0,1,2的数组进行排序，显然遍历两遍可以轻松的解决问题：第一遍统计0,1,2的个数，第二遍填装即可。

但题目要求只遍历一遍，其实仔细想想是可以的，我们可以想想，如果只有0,1两种元素，那么我们只要在遇到0时，把它移动到数组前段，遇到1时把他移动到数组后端就行了。对于0,1,2也是一样的，我们用i记录前段排好序的最后一个0的下一位，用j指向后端排好序的第一个2的前一位，用p指向当前遍历到的元素。

可以知道，始终有i<=p<=j，因此用p>j最为循环终止的条件。

如果p指向0，则把A【p】和A【i】交换，i++。

如果p指向2，则把A【p】和A【j】交换，j--。

如果p指向1，p++

public class No75_SortColors {
	public static void main(String[] args){
		int[] A = new int[]{0,1,2,0,1,2,1,0,2,0,1};
		sortColors(A);
		for(int i:A)
			System.out.print(i+" ");
	}
	public static void sortColors(int[] A) {
        int i = 0;
        int j = A.length-1;
        int p = 0;
        while(p<=j){
        	if(A[p] == 1){
        		p++;
        		continue;
        	}
        	if(A[p] == 0){
        		if(i != p){
        			int tmp = A[i];
            		A[i] = A[p];
            		A[p] = tmp;
        		}
        		else 
        			p++;
        		i++;
        		continue;
        	}
        	if(A[p] == 2){
        		int tmp = A[j];
        		A[j] = A[p];
        		A[p] = tmp;
        		j--;
        		continue;
        	}
        }
    }
}