在网上get到一个c++全排列函数,用来暴力破解很爽,免去多层循环的麻烦
STL的算法,用来实现排列组合的全排列。
#include<iostream>
#include<algorithm>
using namespace std;
int cmp(int a,int b)
{
returna<b;
}
int main()
{
intmyints[] = {1,2,3};
cout<< "The 3! possible permutations with 3 elements:\n";
sort(myints,myints+3,cmp); //代表排序数组第一位到第三位
do{
cout << myints[0] << "" << myints[1] << " " << myints[2] <<endl;
} while ( next_permutation (myints,myints+3));
return0;
}
输出为:
The 3! possible permutations with 3 elements:
1 2 3
1 3 2
2 1 3
2 3 1
3 1 2
3 2 1