LeetCode OJ:Sort Colors

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.

click to show follow up.

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?

算法思想：

前后两个指针，0往前放，2往后放，剩下的在中间，肯定是1

class Solution {
public:
    void sortColors(int A[], int n) {
        int i=0,j=0,k=n-1;
        while(i<=k){
            if(A[i]==0){
                if(i!=j){
                    swap(A[i],A[j]);
                    j++;
                    continue;
                }
                else j++;
            }
            else if(A[i]==2){
                if(i!=k){
                    swap(A[i],A[k]);
                    k--;
                    continue;
                }
                else k--;
            }
            i++;
        }
    }
};

统计的思想：

记录012出现的次数

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;
    }
};

利用partitiion函数

class Solution {
public:
    void sortColors(int A[], int n) {
        partition(partition(A,A+n,bind2nd(equal_to<int>(),0)),A+n,
                    bind2nd(equal_to<int>(),1));
    }
};

自己实现partition函数

class Solution {
public:
    void sortColors(int A[], int n) {
        partition(partition(A,A+n,bind2nd(equal_to<int>(),0)),A+n,
                    bind2nd(equal_to<int>(),1));
    }
private:
    template<typename ForwardIterator,typename UnaryPredicate>
    ForwardIterator partition(ForwardIterator first,ForwardIterator last,
                                UnaryPredicate pred){
        auto pos=first;
        for(;first!=last;++first)
            if(pred(*first))
                swap(*first,*pos++);
        return pos;
    }
};