题解 | 排序危机
排序危机
https://www.nowcoder.com/practice/fb6a53f3ebae449cb268fd9a99cff9ef
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
string lower,digit,upper;
for(char c:s){
if(c>='a'&&c<='z')lower+=c;
else if(c>='0'&&c<='9')digit+=c;
else if(c>='A'&&c<='Z')upper+=c;
}
cout << lower+digit+upper << endl;
return 0;
}
查看2道真题和解析