LeetCode-Sort Color

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?
题意：
给定一个具有n个对象的阵列，这些对象被着色为红色、白色或蓝色，对它们进行排序，使得相同颜色的对象相邻，颜色按红色、白色和蓝色的顺序排列。
这里，我们将使用整数0、1和2分别表示红色、白色和蓝色。

注:
对于此问题，不应使用库的排序功能。

后续行动:
一个相当直接的解决方案是使用计数排序的两遍算法。
首先，重复数组计数0、1和2，然后用总数0覆盖数组，然后用1覆盖数组，再用2覆盖数组
你能想出一个只用常数空间的单程算法吗？

class Solution {
public:
    void sortColors(int A[], int n) {
       int left = 0;
       int right = n-1;
       int i = 0;
       while(i <= right){
           if(A[i] == 0){
               int temp = A[i];
               A[i] = A[left];
               A[left] = temp;
               left++;
               i++;
           }
           else if(A[i] == 1)
           {
               i++;
           }
           else
           {
               int temp = A[i];
               A[i] = A[right];
               A[right] = temp;
               right--;
           }
       }
    }
};