01调函数实现全排列

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main()
{
    int n;
    cin >> n;//求1-n的全排列

    vector<int> vi;
    for (int i=1;i<=n;i++)
    {
        vi.push_back(i);
    }

    do 
    {
        for (int i=0;i<n;i++)
        {
            cout << vi[i] << " ";
        }
        cout << endl;
    } while (next_permutation(vi.begin(),vi.end()));

/*
    int a[3] = { 1,2,3 };
    do 
    {
        cout << a[0] << a[1] << a[2] <<endl;
    } while (next_permutation(a,a+3));
*/
    return 0;
}