题解 | 全排列

#include<bits/stdc++.h>
using namespace std;

void fullrank(string pre,string str)
{
    if(str.length() == 1)
    {
        cout<<pre+str<<endl;
        return;
    }
    string nextpre = "";
    string nextstr = "";
    for(int i = 0;i<str.length();i++)
    {
        nextpre = pre + str[i];
        nextstr = str;
        nextstr.erase(i,1);
        fullrank(nextpre,nextstr);
    }
}

int main()
{
    string str;
    string pre = "";
    while(cin>>str)
    {
        fullrank(pre,str);

    }

    return 0;
}