C++ STL 容器元素排列之next_permutation和prev_permutation的使用示范

//本程序示例演示next_permutation和prev_permutation#include <iostream>#include <vector>#include <deque>#include <algorithm>#include <iterator>using namespace std;int main(){deque<int> d1;vector<int> v1;int dim[]={4,1,3,2};v1.assign(dim,dim+4);copy(v1.begin(),v1.end(),ostream_iterator<int>(cout,",")); //输出v1的值cout<<endl;copy(v1.begin(),v1.end(),back_inserter(d1)); //d1的初始化while(next_permutation(d1.begin(),d1.end())){ //向降序方向前进copy(d1.begin(),d1.end(),ostream_iterator<int>(cout,",")); //输出cout<<endl;}cout<<"------------------"<<endl;//向着升序方向前进d1.assign(dim,dim+4);copy(d1.begin(),d1.end(),ostream_iterator<int>(cout,",")); //输出d1的内容cout<<endl;while(prev_permutation(d1.begin(),d1.end())){copy(d1.begin(),d1.end(),ostream_iterator<int>(cout,",")); //输出cout<<endl;}return 0;}