题解 | 字符串排序

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

bool toLowerChar(char src, char& dest) {
    if (src >= 'A' && src <= 'Z') {
        dest = src + 32;
    } else if (src >= 'a' && src <= 'z') {
        dest = src;
    } else {
        return false;
    }
    return true;
}

int main() {
    string s;
    getline(cin, s);
    char front, behind, tmp;
    for (int i = 0; i < s.length() - 1; i++) {
        int n = 1;
        for (int j = 0; j < s.length() - n - i;) {
            if (!toLowerChar(s[j], front)) {
                ++ j;
                continue;
            }
            if (!toLowerChar(s[j+n], behind)) {
                ++ n;
                continue;
            }
            if (front > behind) {
                tmp = s[j];
                s[j] = s[j+n];
                s[j+n] = tmp;
            }
            ++ j;
            n = 1;
        }
    }
    cout << s << endl;
}
// 64 位输出请用 printf("%lld")