题解 | #字符串排序#

#include <iostream>
#include <string>
#include <deque>
using namespace std;

int main(){
    string str;
    deque<char> m1help;
    getline(cin, str);
    for(int i = 0; i < 26; i++){
        for(int j = 0; j < str.length(); j++){
            if(str[j] == 'a' + i || str[j] == 'A' + i)
                m1help.push_back(str[j]);
        }
    }
    for(int i = 0; i < str.length(); i++){
        if(str[i] >= 'a' && str[i] <= 'z' || str[i] >= 'A' && str[i] <= 'Z'){
            str[i] = m1help.front();
            m1help.pop_front();
        }
    }
    cout << str;
    return 0;
}

提取出字母，一轮堆排序，放回字母，结束