全排列permute,python回溯实现全排列,permute backtracking

发布时间 2023-03-26 17:54:06作者: fufu1
def get_permute2(nums):
ret = []
path = []
def backtracking(nums,usage_list):
if len(path) == len(nums):
ret.append(path[:])
return
for i in range(0,len(nums)):
if usage_list[i]:
continue
path.append(nums[i])
usage_list[i] = True
backtracking(nums,usage_list)
path.pop()
usage_list[i] = False
usage_list = [False]*len(nums)
backtracking(nums,usage_list)
return ret