leetcode-46-全排列

題目描述： 方法一：回溯 class Solution: def permute(self, nums): n = len(nums) res = [] def helper2(nums, temp_list, length): if length == n: res.append(te

>>阅读原文<<