leetcode 刷题 46 47

class Solution: def permute(self, nums: List[int]) -> List[List[int]]: ans = [nums] for i in range(1, len(nums)): m = len(ans) for k in range(m): for j in range(i): ans.append(ans[k][:]) ans[-1][j], ans[-1][i] = ans[-1][i], ans[-1][j] return ans

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
 

class Solution: def permuteUnique(self, nums: List[int]) -> List[List[int]]: ans = [nums] for i in range(1, len(nums)): m = len(ans) for k in range(m): for j in range(i - 1, -1, -1): if ans[k][j] == ans[k][i]: break ans.append(ans[k][:]) val = ans[-1][j] ans[-1][j] = ans[-1][i] ans[-1][i] = val return ans

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
 

文章来源: maoli.blog.csdn.net，作者：刘润森！，版权归原作者所有，如需转载，请联系作者。

原文链接：maoli.blog.csdn.net/article/details/90382091