题解 | #没有重复项数字的全排列#

class Solution:
    def permute(self, num: List[int]) -> List[List[int]]:
        res = []
        if len(num) <= 1:
            res.append(num)
        else:
            for i in range(len(num)):
                ele = num[i]
                remain = num[:i] + num[i + 1 :]
                for perms in self.permute(remain):
                    res.append([ele] + perms)
        return res