2025/10/16

思路：这是暴力回溯的例题

手写代码：


def DFS(current, nums, results):
    results.append(current)
    for i in nums:
        if i not in current:
            DFS(current+[i], nums, results)

DFS([], nums, [])

评价：思路正确，代码与一般写法稍有不同