一荡澎、題目描述
給定一個(gè)沒(méi)有重復(fù)數(shù)字的序列掉奄，返回其所有可能的全排列路鹰。
示例：
輸入: [1,2,3]
輸出:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]
二狰晚、代碼實(shí)現(xiàn)
深搜
class Solution(object):
def permute(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
finallen = len(nums)
def dfs(nums, cur, res):
if len(cur) == finallen:
res.append(cur)
return
for index, num in enumerate(nums):
dfs(nums[:index] + nums[index+1:], cur + [num], res)
res = []
cur = []
for index, num in enumerate(nums):
dfs(nums[:index] + nums[index+1:], cur + [num], res)
return res
