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

方法一：桶排序，时间复杂度为O(N)，额外空间为count（3），即为O(1)

class Solution {
public:
void sortColors(int A[], int n) {
        if(A==NULL||n<=0)
            return;
        vector<int> count(3,0);
        for(int i=0;i<n;i++){
            count[A[i]]++;
        }
        int index=0;
        for(int i=0;i<3;i++){
            for(int j=0;j<count[i];j++){
                A[index++]=i;
            }
        }
    }
};

方法二：双指针遍历

class Solution {
public:
void sortColors(int A[], int n) {
        if(A==NULL||n<=0)
            return;
          int left=0;
        int right=n-1;
        int i=left;
        while(i<=right){
            if(A[i]==0){
                swap(A[i],A[left]);
                i++;   //从左往右，0都放到了left之前，所以swap(A[i],A[left])之后，i++
                left++;
            }
            else if(A[i]==1){
                i++;
            }
            else{
                swap(A[i],A[right]); //A[right]有可能为0或2
                right--;
            }
        }
    }
};