题目
给定一个 没有重复 数字的序列,返回其所有可能的全排列。
示例:
输入: [1,2,3]
输出:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]
代码
class Solution:
def permute(self, nums: List[int]) -> List[List[int]]:
if not nums: return []
size = len(nums)
flag = [False for _ in range(size)]
ans = []
path = []
def dfs(nums,k,size,ans,path):
if k==size:
ans.append(path[:])
for i in range(size):
if flag[i]==False:
path.append(nums[i])
flag[i]=True
dfs(nums,k+1,size,ans,path)
flag[i]=False
path.pop()
dfs(nums,0,size,ans,path)
return ans
题目二
给定一个可包含重复数字的序列,返回所有不重复的全排列。
输入: [1,1,2]
输出:
[
[1,1,2],
[1,2,1],
[2,1,1]
]
代码
class Solution:
def permuteUnique(self, nums: List[int]) -> List[List[int]]:
if not nums: return[]
nums.sort()
size = len(nums)
flag = [False for _ in range(size)]
ans = []
path = []
def dfs(nums,k,ans,path):
if k==size:
ans.append(path[:])
return
for i in range(size):
if flag[i]==False:
if i>0 and nums[i]==nums[i-1] and not flag[i-1]:
continue
path.append(nums[i])
flag[i]=True
dfs(nums,k+1,ans,path)
flag[i]=False
path.pop()
dfs(nums,0,ans,path)
return ans