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），只需在第一遍遍历数组时统计各个数字的个数，然后第二遍遍历填入数组即可。

题目的提高要求只使用“一遍遍立法”，自己没有想出来好的办法，在网上搜到一个大神非常优雅的解法，仅供分享！

这个解法的主要思想就是采用“整体位移”的方法，每读入一个数字，根据其值选择是将1和2都向前移动然后在空出的位置填入0，还是只将2向前移动然后在空出的位置填入1，还是只用在末尾直接填入2即可。采用三个索引i， j， k分别（共同）控制0，1，2各自连续数字串的位置，非常优雅！膜拜！

void sortColors(int* nums, int numsSize) {
	int i = -1, j = -1, k = -1;
	int p;
	for(p = 0; p < numsSize; p++){
		if(nums[p] == 0){
			nums[++k] = 2;		/* move '2' forward */
			nums[++j] = 1;		/* move '1' forward */
			nums[++i] = 0;		/* add a new '0' after the last '0' */
		}else if(nums[p] == 1){
			nums[++k] = 2;
			nums[++j] = 1;
		}else{
			nums[++k] = 2;
		}
	}
}