题解 | #后缀子串排序#
后缀子串排序
http://www.nowcoder.com/practice/f89f96ea3145418b8e6c3eb75773f65a
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
string s;
vector<string> ans;
while(cin >> s)
{
for(int i = 0; i < s.size(); i ++)
ans.push_back(s.substr(i, s.size()));
sort(ans.begin(), ans.end());
for(string a : ans)
cout << a << endl;
}
return 0;
}