题解 | #字符串排序#

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
#include <unordered_map>
#include <map>
#include <algorithm>

bool cmp(const string& a,const string& b){
    int size = min(a.size(),b.size());
    for(int i = 0;i<size;i++){
        if(a[i] == b[i])
            continue;
        else
            return a[i] < b[i];
    }
    return a.size() < b.size() ? true : false;
}

int main() {
    int n;
    cin >> n;
    vector<string> a;
    for(int i = 0;i<n;i++){
        string t;
        cin >> t;
        a.push_back(t);
    }
    sort(a.begin(),a.end(),cmp);

    for(auto x:a)
        cout << x << endl;
}

重写了cmp方法，考虑空字符串，虽然默认就是字典排序