LeetCode75. Sort Colors（C++）

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?

空间复杂度O(1)

解题思路：计数排序的思想，输出0,1,2的个数

class Solution {
public:
    void sortColors(vector<int>& nums) {
        int visit[3]={0},cnt=0;
        for(int i=0;i<nums.size();i++)
            visit[nums[i]]++;
        for(int i=0;i<3;i++)
            while(visit[i]-->0)
                nums[cnt++]=i;
    }
};