蓝桥杯—next_permutation()全排列函数

/*输出字符串的全排列*/#include <iostream>#include <algorithm>#include <string>using namespace std;int main(){    string str;    cin >> str;    sort(str.begin(), str.end());    cout << str << endl;    while (next_permutation(str.begin(), str.end()))    {        cout << str << endl;    }    return 0;}

运行结果：

/*实现数组int型全排列*/#include <cstdio>#include <algorithm>#include <cstring>#include <iostream>using namespace std;int main(){    int a[100],i,n;    scanf("%d",&n);    for (i=0; i<n; i++)        scanf("%d",&a[i]);        //sort(a,a+n);    sort(a,a+n);    do    {        for (i=0; i<n; i++)            printf("%d ",a[i]);        printf("\n");    }    while (next_permutation(a,a+n));    return 0;}

运行结果：