一、leetcode地址
https://leetcode.com/problems/permutations/
二、问题描述
三、代码实现
语言:Python3
代码:
class Solution:
def permute(self, nums: List[int]) -> List[List[int]]:
if len(nums) == 1 or len(nums) == 0:
return [nums]
list1 = []
for i in range(len(nums)):
temp = nums[:i]+nums[i+1:]
list0 = self.permute(temp)
for item in list0:
list1.append([nums[i]]+item)
return list1