-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathleetcode_47.py
More file actions
72 lines (62 loc) · 1.82 KB
/
leetcode_47.py
File metadata and controls
72 lines (62 loc) · 1.82 KB
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
# coding=utf-8
from typing import List, Set, Tuple
class Solution:
"""
数组的全排列
"""
def permute_rec(self, nums: List[int], start: int, result: Set[Tuple[int]]):
"""
:param nums:
:param start:
:param result:
:return:
"""
if start == len(nums):
result.add(tuple(nums))
return
for i in range(start, len(nums)):
nums[start], nums[i] = nums[i], nums[start]
self.permute_rec(nums, start + 1, result)
nums[start], nums[i] = nums[i], nums[start]
def permute_unique_using_set(self, nums: List[int]) -> List[List[int]]:
"""
Time: O(n*n!), Space: O(n)
:param nums:
:return:
"""
if not nums:
return []
result = set()
self.permute_rec(nums, 0, result)
return list(result)
def next_permutation(self, nums: List[int]) -> bool:
"""
:param nums:
:return:
"""
n, p = len(nums), len(nums) - 2
while p >= 0 and nums[p] >= nums[p + 1]:
p -= 1
if p >= 0:
i = n - 1
while i > p and nums[i] <= nums[p]:
i -= 1
nums[p], nums[i] = nums[i], nums[p]
left, right = p + 1, n - 1
while left < right:
nums[left], nums[right] = nums[right], nums[left]
left, right = left + 1, right - 1
return p != -1
def permute_unique_using_next_permutation(self, nums: List[int]) -> List[List[int]]:
"""
Time: O(n*n!), Space: O(1)
:param nums:
:return:
"""
if not nums:
return []
nums.sort()
result = [nums]
while self.next_permutation(nums):
result.append(list(nums))
return result