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.
分析： 一开始看到这个觉得肯定有非常简单有效地算法，采用多指针法，注意w,r,b的顺序，还是比较难想的
class Solution {
public:
void sortColors(vector<int>& nums) {
int r = 0, w = 0, b = 0;
for (int i = 0; i < nums.size(); i++) {
int num = nums[i];
cout << num << endl;
if (num == 0) {nums[b++] = 2; nums[w++] = 1; nums[r++] = 0; }
else if (num == 1) {nums[b++] = 2; nums[w++] = 1;}
else if (num == 2) b++;
}
}
};
原文：http://www.cnblogs.com/willwu/p/6238388.html