75. Sort Colors

problem:

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.

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?

本问题是一个排序问题，用三个变量记录red,white,blue的下标位置。起始下标都为-1

如果A[i] == 0 ，插入red对white blue有影响，blue先整体向后移动一位，white再整体向后移动一位，如果不移动，前面插入的数据就会覆盖已有的。

如果A[i] == 1，插入white对blue有影响，blue整体向后移动一位。

A[i] == 2，直接插入blue

class Solution {
public:
    void sortColors(vector<int>& nums) {
        if(nums.size() <= 1)
            return;
        int red = -1, white = -1, blue = -1;
        for(int i=0; i<nums.size(); i++)
        {
            //insert red, affect white blue
            if(nums[i] == 0)
            {
                //move blue
                nums[++blue] = 2;
                //move white
                nums[++white] = 1;
                //insert red
                nums[++red] = 0;
            }
            else if(nums[i] == 1)
            {
                nums[++blue] = 2;
                nums[++white] = 1;
            }
            else
                nums[++blue] = 2;
        }
    }
};