LeetCode OJ 之 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?

给定一个有n个物体的数组，这些物体被标记为红色，白色，和蓝色。把它们按照红，白，蓝的顺序排序使得相同颜色的物体相邻。

这里使用0,1,2 代表红色，白色和蓝色。

注意：

不能使用库函数的sort排序。

思路：

由于0, 1, 2 非常紧凑，首先想到计数排序(counting sort)，但需要扫描两遍，不符合题目要求。

由于只有三种颜色，可以设置两个index，一个是red 的index，一个是blue 的index，两边往中间走。时间复杂度O(n)，空间复杂度O(1)。

代码1：

class Solution {
public:
    void sortColors(int A[], int n) 
    {
        int counts[3] = { 0 }; // 记录每个颜色出现的次数
        for (int i = 0; i < n; i++)
        {
            counts[A[i]]++;
        }
        for (int i = 0, index = 0; i < 3; i++)
        {
            for (int j = 0; j < counts[i]; j++)
            {
                A[index++] = i;
            }
        }
    }
};

代码2：

class Solution {
public:
    void sortColors(int A[], int n)
    {
        int begin = 0 , mid = 0 , end = n-1;
        if(n <= 1)
            return ;
        while( mid <= end)
        {
            if(A[mid] == 0)
            {
                int temp = A[mid];
                A[mid] = A[begin];
                A[begin] = temp;
                begin++;
                mid++;//mid可以++
            }
            else
                if(A[mid] == 2)
                {
                    int temp = A[mid];
                    A[mid] = A[end];
                    A[end] = temp;
                    end--;//此时mid不能++
                }
                else
                    mid++;
        }
    }
};