给定一个没有重复数字的序列,返回其所有可能的全排列。
示例:
输入: [1,2,3]
输出:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]
def permution(first, second, res):
if not second:
res.append(first)
return
for s in second:
tempf = first[:]
tempf.append(s)
temps = second[:]
temps.remove(s)
permution(tempf, temps ,res)
class Solution(object):
def permute(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
res = []
permution([], nums ,res)
return res