next_permutation()的用法
#include<bits/stdc++.h>
using namespace std;
int main ()
{
int a[3];
for(int i = 0; i < 3;i ++)
{
a[i] = i;
}
next_permutation(a,a+3);
next_permutation(a,a+3);
next_permutation(a,a+3);
next_permutation(a,a+3);
next_permutation(a,a+3);
next_permutation(a,a+3);//每次加入都不一样,就是排序
for(int i = 0; i< 3 ; i++)
{
cout<<a[i]<<" ";
}
}
一般的话需要用到循环下面是循环的一个例子-----用STL输出全排列
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[4] = {5,2,4,1};
sort(a,a+4);
do
{
for(int i = 0; i < 4;i++)
cout<<a[i]<<" ";
cout << endl;
}while(next_permutation(a,a + 4));
return 0;
}
结果