-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path22.括号生成.py
83 lines (75 loc) · 1.59 KB
/
22.括号生成.py
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
73
74
75
76
77
78
79
80
81
82
#
# @lc app=leetcode.cn id=22 lang=python3
#
# [22] 括号生成
#
# https://leetcode.cn/problems/generate-parentheses/description/
#
# algorithms
# Medium (77.56%)
# Likes: 2889
# Dislikes: 0
# Total Accepted: 598.2K
# Total Submissions: 771.3K
# Testcase Example: '3'
#
# 数字 n 代表生成括号的对数,请你设计一个函数,用于能够生成所有可能的并且 有效的 括号组合。
#
#
#
# 示例 1:
#
#
# 输入:n = 3
# 输出:["((()))","(()())","(())()","()(())","()()()"]
#
#
# 示例 2:
#
#
# 输入:n = 1
# 输出:["()"]
#
#
#
#
# 提示:
#
#
# 1 <= n <= 8
#
#
#
# @lc code=start
class Solution:
def generateParenthesis(self, n: int) -> List[str]:
# 1. 递归 O(4^n/n*) O(N)
# # 1.1
# res = []
# def backtrack(s, left, right):
# if right == n:
# res.append(''.join(s))
# return
# if left < n:
# s.append('(')
# backtrack(s, left+1, right)
# s.pop()
# if right < left:
# s.append(')')
# backtrack(s, left, right+1)
# s.pop()
# backtrack([], 0, 0)
# return res
# 1.2
res = []
def backtrack(s, left, right):
if right == n:
res.append(s)
return
if left < n:
backtrack(s+'(', left+1, right)
if right < left:
backtrack(s+')', left, right+1)
backtrack('', 0, 0)
return res
# @lc code=end