LeetCode || Sort Colors

Sort Colors

  Total Accepted: 10901  Total Submissions: 35483 My Submissions

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,1,2三种值，要求对其进行升序重排序，提示是利用计数法，记录0、1、2分别出现的次数，然后再对A进行赋值，这需要两遍遍历，问能不能一遍实现？

方法一：扫描过程中，遇到0就往前面交换，遇到2就往后面交换，利用两个变量p0和p2记录交换的目的位置。

class Solution {
public:
    void sortColors(int A[], int n) {
        int p0=0, p2=n-1;
        for(int i=0; i<n; i++){
            if(A[i]==0&&i>p0)
                swap(A[p0++], A[i]);
            if(A[i]==2&&i<p2)
                swap(A[i--], A[p2--]);
            if(A[p0]==0)
                p0++;
            if(A[p2]==2)
                p2--;
        }
    }
    
};

注意交换2时，要把 i 减一，避免A【p2】==2的情况，即交换过来的数也为2，那么需要再次检查这个值。

方法二：论坛牛人解法， 即用三个位置变量分别记录0、1、2 要放置的位置：

class Solution {
public:
    void sortColors(int A[], int n) {
        int k2=-1, k1=-1, k0=-1;
        for(int i=0; i<n; i++){
            if(A[i]==0){
                A[++k2]=2;
                A[++k1]=1;
                A[++k0]=0;
            }
            else if(A[i]==1){
                A[++k2]=2;
                A[++k1]=1;
            }
            else if(A[i]==2)
                A[++k2]=2;
        }
    }
};