[Leetcode]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?

class Solution {public:    /*algorithm        count sort,two pass solution        time O(n) space O(1)    */    void sortColors(vector<int>& nums) {        int colors[3]={0};        for(int i = 0;i < nums.size();i++){            colors[nums[i]]++;        }        for(int c = 0,i = 0;c < 3;c++){            int color = colors[c];            while(color-- > 0)nums[i++]=c;        }    }};

class Solution {public:    /*algorithm        two pointers : one pass solution        two pointer : one point to 0 array, one pointe to 2 array,        when they meet, sort finish        time O(n) space O(1)    */    void sortColors(vector<int>& nums) {        int red = 0; // tail(0's) + 1        int blue = (int)nums.size() - 1; //head(2's) - 1        int i = 0;        while(i <= blue){            if(nums[i] == 0){ //red                swap(nums[i],nums[red]);                red++;                i++;            }else if(nums[i] == 2){//blue                swap(nums[i],nums[blue]);                blue--;            }else{ //white                ++i;            }        }            }};