版权声明: https://blog.csdn.net/hsc_1/article/details/82954358
给定一个没有重复数字的序列,返回其所有可能的全排列。
示例:
输入: [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):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
res = [[]]
for ele in nums:
res_tmp = []
for numbers in res:
for i in range(len(numbers) + 1):
res_tmp.append(numbers[:i] + [ele] + numbers[i:])
res = res_tmp
return res