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

解答：

class Solution {
public:
    void sortColors(int A[], int n) {
        if(n == 0) {
            return;
        }
        int head = 0;
        int cur = 0;
        int end = n - 1;
        int tmp;
        
        while(cur <= end) {
            if(A[cur] == 0) {
                if(cur != head) {
                    tmp = A[cur];
                    A[cur] = A[head];
                    A[head] = tmp;
                }
                else {
                    cur ++;
                }
                head ++;
            }
            else if(A[cur] == 1) {
                cur ++;
            }
            else if(A[cur] == 2) {
                tmp = A[cur];
                A[cur] = A[end];
                A[end] = tmp;
                end --;
            }
        }
        return;
    }
};

思路：我用的方法是最简单粗暴的，即设定head、end、cur三个指针，当cur遇到0时，如果cur != head，则把该位的0与head处的数字交换，head自加1；当cur遇到2时，则把该位的2与end处的数字交换，end自减1；由于是从前向后遍历，所以当遇到1或head与cur同时指向0时，cur自加1。当cur超过end时，数组变换完成，可以保证其安装0，1，2的顺序排列。

网上还有一种效率更高的算法，如下：

public void sortColors(int[] A) {


    int i=-1, j=-1, k=-1;

    for(int p = 0; p < A.length; p++)
    {
        if(A[p] == 0)
        {
            A[++k]=2;
            A[++j]=1;
            A[++i]=0;
        }
        else if (A[p] == 1)
        {
            A[++k]=2;
            A[++j]=1;

        }
        else if (A[p] == 2)
        {
            A[++k]=2;
        }
    }

}

这种算法的思路可以简单理解为利用三个指针实现了对0，1，2的挪动，指针i指向存放0区域的末尾，j、k分别指向1，2区域的末尾。以遇到0为例，当遇到0时，A[++i]=0是为了给0区域尾部添加一个0，而A[++j]=1和A[++k]=2的操作则是为了把1、2区域整体向后移动1个单位。