lintcode: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.

Have you met this question in a real interview?

Notice

You are not suppose to use the library's sort function for this problem.
You should do it in-place (sort numbers in the original array).

Example

Given [1, 0, 1, 2], sort it in-place to [0, 1, 1, 2].

Challenge

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?

class Solution{
    
private:
    void swap(vector<int> &nums, int i, int j) {
        
        int tmp = nums[i];
        nums[i] = nums[j];
        nums[j] = tmp;
    }
    
public:
    /**
     * @param nums: A list of integer which is 0, 1 or 2 
     * @return: nothing
     */    
    void sortColors(vector<int> &nums) {
        // write your code here
        
        int redIdx = 0; //为红色的下一个指针，因为前面已经排好序，可以认为是白色的第一个指针
        int curIdx = 0; //为白色的最后一个指针
        int blueIdx = nums.size()-1;//为所有蓝色的前一个指针
        
        while (curIdx <= blueIdx)
        {
            if (nums[curIdx] == 0)
            {
                swap(nums, curIdx, redIdx);
                redIdx++;
                curIdx++;
            }
            else if (nums[curIdx] == 1)
            {
                curIdx++;
            }
            else
            {
                swap(nums, curIdx, blueIdx);
                blueIdx--;
            }
        }
    }
};