题解 | #字符串排序#

字符串排序

https://www.nowcoder.com/practice/5190a1db6f4f4ddb92fd9c365c944584

#include<bits/stdc++.h>
using namespace std;

int main() {
    string str;
    vector<char> vec;

    while (getline(cin, str))  {

        for (int order = 0; order < 26; order++) {
            for (auto c : str) {
                if ((c - 'A' == order) || (c - 'a' == order)) {
                    vec.push_back(c);
                }
            }
        }

        for (int i = 0, k = 0; i < str.size(), k < vec.size(); i++) {
            if ((str[i] >= 'A' && str[i] <= 'Z') || (str[i] >= 'a' && str[i] <= 'z')) {
                str[i] = vec[k++];
            }
        }
        cout << str << endl;

    }
}


全部评论

相关推荐

评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客企业服务