您的位置:首页 > 其它

STL中简单算法实例sort()、next_permutation()

2014-08-28 19:43 260 查看
STL中简单算法实例sort()、next_permutation()
#include<iostream>
#include<string>
#include<algorithm>

using namespace std;

int main()
{
string letters;
cout<<"Enter the letters grouping (quit to quit): ";
while(cin>>letters && letters != "quit")
{
cout<<"Permutations of "<<letters<<endl;
sort(letters.begin(),letters.end());
cout<<letters<<endl;
while(next_permutation(letters.begin(),letters.end()))
cout<<letters<<endl;
cout<<"Enter next sequence (quit to quit):";
}

cout<<"Done.\n";
return 0;
}
结果:
Enter the letters grouping (quit to quit): abc
Permutations of abc
abc
acb
bac
bca
cab
cba
Enter next sequence (quit to quit):
next_permutation()自动提供排列组合。
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息