next_permutation()全排列函数
必须升序才能全排列
next_permutation(num,num+n)函数是对数组num中的前n个元素进行全排列,同时并改变num数组的值
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a[4] = {0,1,4};
while(next_permutation(a,a+4))
{
cout << a[0] << a[1] << a[2] <<endl;
}
return 0;
}
040
041
100
104
140
400
401
410
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a[4] = {0,4,1};
while(next_permutation(a,a+4))
{
cout << a[0] << a[1] << a[2] <<endl;
}
return 0;
}
100
104
140
400
401
410