STL算法 -------- 排列组合

1. next_permutation()            原始数据为升序

2. prev_permutation()            原始数据为降序

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main( int argc, char** argv )
{
	vector<int> vec;
	vec.push_back(1);
	vec.push_back(2);
	vec.push_back(3);

	for(vector<int>::iterator itr=vec.begin(); itr!=vec.end(); ++itr)
	{
		cout<<*itr<<' ';
	}cout<<endl;

	while( next_permutation(vec.begin(), vec.end()) )
	{
		for(vector<int>::iterator itr=vec.begin(); itr!=vec.end(); ++itr)
		{
			cout<<*itr<<' ';
		}cout<<endl;
	}

	cout<<endl<<"vec2:"<<endl;
	vector<int> vec2;
	vec2.push_back(2);
	vec2.push_back(3);
	vec2.push_back(1);
	sort(vec2.begin(), vec2.end());
	cout<<*find(vec2.begin(), vec2.end(), 2)<<endl;;
	for(vector<int>::iterator itr=vec2.begin(); itr!=vec2.end(); ++itr)
	{
		cout<<*itr<<' ';
	}cout<<endl;
	vector<int> vec3;
	vec3.assign(vec2.rbegin(), vec2.rend());
	while( prev_permutation(vec3.begin(), vec3.end()) )
	{
		for(vector<int>::iterator itr=vec3.begin(); itr!=vec3.end(); ++itr)
		{
			cout<<*itr<<' ';
		}cout<<endl;
	}


	return 0;
}