【C++】全排列

给定正整数n，求1,2,3,...,n的全排列

解法一：递归，结果并不为字母序排列。

void Helper(vector<int> v, int low, int high)
{
    if(low == high)
    {
        for(int i = ; i < v.size(); i ++)
            cout << v[i];
        cout << endl;
    }
    else
    {
        for(int i = low; i <= high; i ++)
        {
            swap(v[low], v[i]);
            Helper(v, low+, high);
            swap(v[low], v[i]);
        }
    }
}
void permutation(int n)
{
    vector<int> v(n,);
    for(int i = ; i < n; i ++)
        v[i] = i+;
    Helper(v, , n-);
}

解法二：algorithm库中的next_permutation函数，结果按字母序排列

void permutation(int n)
{
    vector<int> v(n,);
    for(int i = ; i < n; i ++)
        v[i] = i+;
    do
    {
        for(int i = ; i < v.size(); i ++)
            cout << v[i];
        cout << endl;
    }while(next_permutation(v.begin(),v.end()));
}