题目描述:
给定一个没有重复数字的序列,返回其所有可能的全排列。
测试用例:
代码如下:
class Solution:
def permute(self, nums: List[int]) -> List[List[int]]:
length = len(nums)
result = []
def fun1(i):
if i == length:
result.append(nums[:])
for j in range(i,length):
temp = nums[i]
nums[i] = nums[j]
nums[j] = temp
fun1(i+1)
temp = nums[i]
nums[i] = nums[j]
nums[j] = temp
fun1(i=0)
return result