2025/10/16

思路：暴力回溯（因为要求返回所有叶子结点）

手写代码：


def DFS(case, nums, results):

    if len(case) == len(nums):
        results.append()
        return
    else: 
        for n in nums and not in case:
            DFS(case+[n], nums, results)

    

def permute(nums):

    results = []
    DFS([], nums, results)
    return results

评价：完全正确，秒了