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.
还以为是什么涂色,不就是数组分堆嘛……
class Solution {
public:
void sortColors(int A[], int n) {
int r = 0;
int w = 0;
int b = 0;
for(int i = 0; i < n; i++) {
r += A[i] == 0;
w += A[i] == 1;
b += A[i] == 2;
}
for(int i = 0; i < n; i++) {
A[i] = i < r ? 0 : i < r + w ? 1 : 2;
}
}
};
这种比较简单,遍历一次,统计一下每种颜色有多少,然后重新赋值即OK。
后来要求只扫描一遍,如果A[i]=0,交换到前面,A[i]=2,交换到后面。
class Solution {
public:
void sortColors(int A[], int n) {
int one = 0;
int two = n - 1;
int i = 0;
while(i < n) {
switch(A[i]) {
case 0 :
if(i == one) {
i++;
}
else {
swap(A, i, one);
}
one++;
break;
case 1 :
i++;
break;
case 2 :
if(i >= two) {
return;
}
swap(A, i ,two);
two--;
break;
}
}
}
private:
void swap(int A[], int x1, int x2) {
int temp;
temp = A[x1];
A[x1] = A[x2];
A[x2] = temp;
}
};
swap函数,发现有的使用异或的方法,但是提到了使用异或当x1=x2时,运行会出错,于是又添加了个变量;
不过这道题用异或应该也没有问题,之前已经判断是否相等了。
void swap(int A[], int x1, int x2) {
A[x1] ^= A[x2];
A[x2] ^= A[x1];
A[x1] ^= A[x2];
}