题目描述:
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?
非常巧妙的方法,用三个变量分别记录三种颜色最右端的坐标,每当插入对应颜色的时候后面所有的记录都右移一位。
代码如下:
class Solution {
public:
void sortColors(int A[], int n) {
int r(-1), w(-1), b(-1);
for (int i = 0; i < n; i++){
if (A[i] == 0){
A[++b] = 2;
A[++w] = 1;
A[++r] = 0;
}
else if (A[i] == 1){
A[++b] = 2;
A[++w] = 1;
}
else{
A[++b] = 2;
}
}
}
};