Ugly Pairs CodeForces

奇偶分开即可。代码简单思路重要。

#include<bits/stdc++.h>
#include <string> 
using namespace std;
int T;
string s;
int len;
int arr[105];
string s1;
string s2;
int main(){
    cin>>T;
    while(T--){
        cin>>s;
        len=s.size();
        for(int i=0;i<len;i++){
            arr[i]=s[i]-'a';
        } 
        sort(arr,arr+len);
        for(int i=0;i<len;i++){
            if(arr[i]%2){
                s1 += arr[i] + 'a';
            }else{
                s2 += arr[i] + 'a';
            }
        }
        if (abs(s1[s1.size() - 1] - s2[0]) != 1){
            cout<<s1<<s2<<endl;
        } else if(abs(s2[s2.size()-1]-s1[0])!=1){
            cout<<s2<<s1<<endl;
        }else{
            cout<<"No answer"<<endl;
        }
        s="";
        s1="";
        s2="";
    }    
    return 0;
}