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

芜湖！！！

import re
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param num int整型一维数组 
# @return int整型二维数组
#
class Solution:
    def wuhu(self,output,added_list,remain_list):
        n = len(remain_list)
        if n == 0:
            output.append(added_list[:])
        for i in range(n):
            new_added_list = added_list + [remain_list[i]]
            new_remain_list = remain_list[:i] + remain_list[i+1:]
            self.wuhu(output, new_added_list, new_remain_list)


    def permute(self , num: List[int]) -> List[List[int]]:
        # write code here
        output, added_list,remain_list = [],[],num
        self.wuhu(output,added_list,remain_list)
        return output