题解 | #后缀子串排序#

善用STL

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

int main()
{
    string str;
    cin >> str;
    vector<string> toSort;
    for (int i = 0; i < str.size(); ++i) //分割子串
        toSort.push_back(str.substr(i));
    sort(toSort.begin(), toSort.end()); //默认字典序排序
    for (int i = 0; i < toSort.size(); ++i)
        cout << toSort[i] << endl;
    return 0;
}