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；很简单的，我们可以直接使用基数排序，两趟就可以解决了。不过这题的Follow up要求只跑一趟就排序好，这个的难度比较，实际上根本不可能真的一趟就可以排序完，接下来的这个方法虽然是在一趟排序完，但实际上正常情况下回超过n次的

class Solution {
public:
    void sortColors(int A[], int n) {
		if(A==NULL || n<1)
			return ;
		int p_one=0, p_two=n-1, p_three = n-1;
		while(p_one<=p_two)
		{
			if (A[p_one]==0)
				++p_one;
			else if(A[p_one]==1)
			{
				swap(A[p_one],A[p_two]);
				--p_two;
			}
			else
			{
				swap(A[p_one],A[p_three]);
				--p_three;
				p_two = p_three<p_two?p_three:p_two;
			}
		}
    }
private:
	void swap(int &a, int &b)
	{
		int temp = a;
			a = b;
			b = temp;
	}
};