【LeetCode】75. Sort Colors

Given an array with n objects colored red, white or blue, sort them in-place 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.

Example:

Input: [2,0,2,1,1,0]
Output: [0,0,1,1,2,2]

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 a one-pass algorithm using only constant space?
  

一个vector，有012三种元素无序排列，将他们按先0后1再2的顺序排列起来，同样有空间的限制，要求固定存储空间。

思路：两个指针在首尾，一个指针指向当前位置，遇到0交换到序列左边，遇到2交换到序列右边，遇到1不管。

class Solution {
public:
    void sortColors(vector<int>& nums) {
        int left=0,right=nums.size()-1,i=0;
        while(i<=right){
            if(nums[i]==0){
                swap(nums[i], nums[left]);
                left++;
            }
            if(nums[i]==2){
                swap(nums[i], nums[right]);
                right--;
                i--;
            }
            i++;
        }
    }
};