题解 | 后缀子串排序
#include<iostream>
#include<algorithm>
#include <string.h>
#include<vector>
using namespace std;
int main() {
string s;
cin >> s;
vector<string> str;
for (int i = 0; i < s.length(); i++) {
str.push_back(s.substr(i, s.length()));
}
sort(str.begin(), str.end());
for (int i = 0; i < s.length(); i++) {
cout << str[i] << '\n';
}
}
查看9道真题和解析