next_permutation()全排列函数

@QJM

#include
#include
using namespace std;
int main()
{
int num[3]={1,2,3};
do
{
cout<<num[0]<<" “<<num[1]<<” "<<num[2]<<endl;
}while(next_permutation(num,num+3));
return 0;
}

next_permutation(num,num+n)
对数组前n个元素进行全排列
n为2则对前2个元素全排列