# LeetCode Sort Colors

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.

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(vector<int>& nums) {
int p0 = 0, p2 = nums.size() - 1; // p0和p2分别代表下一个0和2应该填入的位置
int n1 = 0; // 1的数量
for (int i = 0; i <= p2; i++) {
if (nums[i] == 0)nums[p0++] = nums[i];
else if (nums[i] == 1)n1++;
else {
swap(nums[i], nums[p2]);
p2--;
i--;
}
}
for (int i = 0; i < n1; i++)
nums[p0++] = 1;
}
};
```