全排列生成

#include<iostream>
#include<algorithm>
using namespace std;
int main() {
    string str;
    cout << "please input the sequense:" << endl;
    cin >> str;
    sort(str.begin(), str.end());
    while (next_permutation(str.begin(),str.end()))
    {
        cout << str<<endl;
    }
    return 0;
}

class Solution:
    def permute(self, nums: list[int]) -> list[list[int]]:
        res = []
        def perm(nums,n, f):
            if f==n-1:
                a = []
                for i in range(n):
                    a.append(nums[i])
                res.append(a)
            for i in range(f,n):
                nums[f],nums[i]=nums[i],nums[f]
                perm(nums,n,f+1)
                nums[f], nums[i] = nums[i], nums[f]
        perm(nums,len(nums),0)
        return res
    """输出一个列表更好的写法"""