题目:
给定一个 没有重复 数字的序列,返回其所有可能的全排列。
示例:
输入: [1,2,3]
输出:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/permutations
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
个人思路:
回溯
官方答案推荐:
回溯
python代码:
class Solution:
def permute(self, nums: List[int]) -> List[List[int]]:
resultLists = []
listLength = len(nums)
#思路一:判断当前数是否已在列表中
# def backtrace(curList):
# if len(curList) == listLength:
# resultLists.append(curList.copy())
# for i in range(listLength):
# if nums[i] in curList:
# continue
# curList.append(nums[i])
# backtrace(curList)
# curList.pop()
# backtrace([])
#思路二:截取数组来跳过当前数
def backtrace(curNums,curList):
if len(curList) == listLength:
resultLists.append(curList.copy())
for i in range(len(curNums)):
curList.append(curNums[i])
backtrace(curNums[:i]+curNums[i+1:],curList)
curList.pop()
backtrace(nums,[])
return resultLists
#思路三:最优化,直接用python库函数
#return list(itertools.permutations(nums))
反思:
python依旧神通广大