class Solution:
def permute(self, nums: List[int]) -> List[List[int]]:
if len(nums)==0:
return []
if len(nums)==1:
res=[]
res.append(nums)
return res
length=len(nums)
res=[nums[:2],nums[1::-1]]
k=2
while k <length:
result=[]
for j in range(len(res)):
for i in range(len(res[0])+1):
a=res[j][:]
a.insert(i,nums[len(res[0])])
result.append(a)
res=result[:]
k+=1
return res
腾讯精选17--python
最新推荐文章于 2024-07-24 21:41:09 发布