[题解][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.

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的队尾。

开始时，分别都是指向-1（因为队列中无数字）。

然后根据下一个数字来移动“指针”。

如果是0，则2,1,0三个队尾指针依次后移（表现在代码上就是，依次加1，然后赋值）。

如果是1，则0不动，2,1分别后移。

如果是2，则0,1不懂，2指针直接后移1格，并赋值2.

Code：

class Solution:
    # @param A a list of integers
    # @return nothing, sort in place
    def sortColors(self, A):
        i = -1
        j = -1
        k = -1
        for h in range(0,len(A)):
            if A[h] == 0:
                k+=1
                A[k] = 2
                j+=1
                A[j] = 1
                i+=1
                A[i] = 0
            elif A[h] == 1:
            	k+=1
            	A[k] = 2
            	j+=1
            	A[j] = 1
            elif A[h] == 2:
            	k+=1
            	A[k] = 2