题目描述
The Dutch flag problem is to rearrange an array of characters R, W,and B (red, white, and blue are the colors of the Dutch national flag) so that all the R’s come first, the W’s come next, and the B’s come last. Design a linear in-place algorithm for this problem.
输入
two lines, the first line is total of numbers characters R,W and B ,and the numbers less than 500005 the second line is random characters R,W and B
输出
a line, all the R’s come first, the W’s come next, and the B’s come last.
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n){
char a[500005];
int r=0,w=0,b=0,sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]=='R'){
r++;
}
else if(a[i]=='W'){
w++;
}
else if(a[i]=='B'){
b++;
}
}
for(int i=0;i<r;i++){
cout<<'R';
sum++;
if(sum==r+w+b){
cout<<endl;
}
}
for(int i=0;i<w;i++){
cout<<'W';
sum++;
if(sum==r+w+b){
cout<<endl;
}
}
for(int i=0;i<b;i++){
cout<<'B';
sum++;
if(sum==r+w+b){
cout<<endl;
}
}
}
return 0;
}