【Leetcode 46】全排列

【Leetcode 46】全排列

class Solution: def permute(self, nums): """ :type nums: List[int] :rtype: List[List[int]] """ def backtrack(first=0): # if all integers are used up if first == n: output.append(nums[:]) #nums[:]等于复制数组，不修改原数组 for i in range(first, n): # place i-th integer first # in the current permutation nums[first], nums[i] = nums[i], nums[first] # use next integers to complete the permutations backtrack(first + 1) # backtrack nums[first], nums[i] = nums[i], nums[first] #交换完顺序再把顺序给改回来 n = len(nums) output = [] backtrack() return output

参考链接​​​ https://leetcode-cn.com/problems/permutations/solution/quan-pai-lie-by-leetcode/​​

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。