#46. 全排列

class Solution:
    def permute(self, nums: List[int]) -> List[List[int]]:
        if(len(nums) == 0):
            return []
        tmp = []
        res = []
        flag = [0] * len(nums)
        def backtrace():
            if (len(tmp) == len(nums)):
                res.append(tmp.copy())
                return
            for i in range(len(nums)):
                if flag[i] == 1:
                    continue
                tmp.append(nums[i])
                flag[i] = 1
                backtrace()
                flag[i] = 0
                tmp.pop()
            return
        backtrace()
        return res