题解 | #后缀子串排序#
后缀子串排序
https://www.nowcoder.com/practice/f89f96ea3145418b8e6c3eb75773f65a
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<string> strs;
int main() {
string str;
cin >> str;
for(int i = 0; i < str.length(); i ++){
strs.push_back(str.substr(i));//调用substr函数获取所有子串
}
//调用sort函数
sort(strs.begin(), strs.end());
for(string s : strs){
cout << s << endl;
}
return 0;
}
