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

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param num int整型一维数组 
# @return int整型二维数组
#
class Solution:
    def ser(self,has,left):
        if len(left)==0:
            return has
        alllist= []
        for i in range(len(left)):
            newleft = left[:i] + left[i+1:]
            thislist = self.ser(has+[left[i]], newleft)
            if len(left)==1:
                alllist.append(thislist)
            else:
                alllist+=thislist
        print(alllist)
        return alllist
        
    def permute(self , num: List[int]) -> List[List[int]]:
        # write code here
        alllist = self.ser([],num)
        return sorted(alllist)