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()自动提供排列组合。
相关文章推荐
- STL 排序算法之全排列sort和next_permutation
- STL经典算法集锦之排列(next_permutation/prev_permutation
- STL 源码剖析 算法 stl_algo.h -- next_permutation
- 几个STL算法:includes,set_difference、set_intersection、set_symmetric_difference、set_union, pre_permutation, next_permutation
- STL的排列算法next_permutation
- STL源码——排列生成算法(next-permutation、pre-permutation)
- STL 源代码剖析 算法 stl_algo.h -- next_permutation
- 蓝桥杯 - 算法提高 排列数 【STL-next_permutation求全排列】
- STL经典算法集锦<六>之排列(next_permutation/prev_permutation)
- stl算法:next_permutation剖析
- HDOJ 1027 Ignatius and the Princess II(找出第m大排列,STL,next_permutation()函数的简单使用)
- STL算法之 next_permutation、prev_permutation 的原理和实现
- STL_算法_排列(prev_permutation、next_permutation)
- stl算法:next_permutation剖析
- 【STL】全排列生成算法:next_permutation
- 几个STL算法:includes,set_difference、set_intersection、set_symmetric_difference、set_union, pre_permutation, next_permutation
- STL算法:prev_permutation和next_permutation的使用
- stl算法:next_permutation剖析
- stl算法:next_permutation剖析
- STL算法find,find_if,find_if_not,sort,fill,for_each,count,adjacent_find,random_shuffle,prev_permutation