后缀子串排序 题解：
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
int main() {
string s;
while (cin >> s) {
string str[10000];
int index = 0;
for (int i = 0;i < s.length();i++) {
for (int j = i;j < s.length();j++) {
str[index] += s[j];
}
index++;
}
sort(str, str + index);
for (int i = 0;i < index;i++) {
cout << str[i] << endl;
}
}
return 0;
}
The road of your choice, you have to go on !
粤ICP备16082171号-1
登录后发布评论
一神神了有没有懂的