-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathleetcode_46.py
More file actions
35 lines (29 loc) · 824 Bytes
/
leetcode_46.py
File metadata and controls
35 lines (29 loc) · 824 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
# coding=utf-8
from typing import List
class Solution:
"""
数组的全排列
"""
def permute_rec(self, nums: List[int], start: int, result: List[List[int]]):
"""
:param nums:
:param start:
:param result:
:return:
"""
if len(nums) == start:
result.append(list(nums))
return
for i in range(start, len(nums)):
nums[i], nums[start] = nums[start], nums[i]
self.permute_rec(nums, start + 1, result)
nums[i], nums[start] = nums[start], nums[i]
def permute(self, nums: List[int]) -> List[List[int]]:
"""
Time: O(n*n!), Space: O(n)
:param nums:
:return:
"""
result = []
self.permute_rec(nums, 0, result)
return result