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.

此题是move zero的变形，多出了一个指针，代码如下：

public class Solution {

    public void sortColors(int[] nums) {

        int zero = 0;

        int second = nums.length-1;

        for(int i=0;i<=second;i++){

            while(nums[i]==2&&i<second){

                swap(nums,i,second);

                second--;

            }

            while(nums[i]==0&&i>zero){

                swap(nums,i,zero);

                zero++;

            }

        }

    }

    public void swap(int[] nums,int i,int j){

        int temp = nums[i];

        nums[i] = nums[j];

        nums[j] = temp;

    }

}

75. Sort Colors