C++ 全排列函数 next_permutation

:

// 全排列  next_permutation
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int an[] = {1,2,3,1};
    sort(an,an+4);  // sort 用于数组的方式,感觉会很有用 

    char ac[] = "ABCDEF";

    do {
        for(int i=0;i!=6;++i) cout << ac[i] << ends;
        cout << endl;
    }while(next_permutation(ac,ac+6));

    // 之后字符数组不变:
    cout << "\nAfter permutation: \n";
    for(int i=0;i!=6;++i) cout << ac[i] << ends;
    cout << "\n\n"; 


    do {
        cout << an[0] << ends << an[1] << ends << an[2] << ends << an[3] << endl;
    } while(next_permutation(an,an+4));   // 获取下一个字典序较大的序列 



    // 之后数组不变
    cout << "\nAfter permutaion: \n";
    cout << an[0] << ends << an[1] << ends << an[2] << ends << an[3] << endl; 


    return 0;

}