C++ next_permutation 穷举每一种组合

#include<iostream>#include<algorithm>using namespace std;int a[10],n;void printArr(int a[], int arraySize);int main(){    cin>>n;    for(int i = 0; i < n; i++)        cin>>a[i];    sort(a, a+n); // 先排序    cout<<"here is all the cases:"<<endl;    while(next_permutation(a,a+n))  //穷举每一种组合        printArr(a,n);}void printArr(int a[], int arraySize){    for(int i = 0; i < arraySize; i++)        cout<<a[i]<<" ";    cout<<endl;}

一定要先排序 sort(a, a+n); // 先排序

while(next_permutation(a,a+3))  //穷举前三位的每一种组合