leetcode 46. 全排列

class Solution(object):
    def permute(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        if nums==[]:
            return []
        import numpy
        arr=nums[:]
        res=[]
        def dfs(x):#x为排列到了数组的第几位
            if x==len(nums)-1:
                tmp_arr=arr[:]
                res.append(tmp_arr)
                return
            dfs(x+1)
            for i in range(x+1,len(nums)):
                arr[i],arr[x]=arr[x],arr[i]
                dfs(x+1)
                arr[i],arr[x]=arr[x],arr[i]
        dfs(0)
        return(res)