Leetcode 75. 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.

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?

解决方法：

 对空间和时间都有要求。

- 让i指向第一个不是0的数，让end指向从后往前第一个不是2的数。

- 从前往后，当是0时，将其移到前面，继续处理下一个；当是1时，继续处理下一个；当是2时，将其移到后面，由于可能移过来一个0，所以序号不能增加，只需要将尾指针往前移一即可。

代码：

void sortColors(vector<int>& nums) {
        int i = 0, end = nums.size() -1;
        while(i <= end && nums[i] == 0)
            ++i;
        while(end >=i && nums[end] == 2)
            --end;
        
        int p1 = i;
        while(i<= end){
            if (nums[i] == 0){
                swap(nums[p1++], nums[i++]);                
            }else if (nums[i] == 2){
                swap(nums[end--], nums[i]);
            }else{
                i++;
            }
        }        
    }