数字 n 代表生成括号的对数,请你设计一个函数,用于能够生成所有可能的并且 有效的 括号组合。
示例 1:
输入:n = 3
输出:["((()))","(()())","(())()","()(())","()()()"]
示例 2:
输入:n = 1
输出:["()"]
提示:
1 <= n <= 8
链接:https://leetcode-cn.com/problems/generate-parentheses
class Solution:
def generateParenthesis(self, n: int) -> List[str]:
if n <= 0:return []
res = []
def dfs(str_path, left, right):
if left >n or right > left:
return
if len(str_path) == 2*n:
res.append(str_path)
return
dfs(str_path + "(", left + 1, right)
dfs(str_path + ")", left, right + 1)
dfs("", 0, 0)
return res
参考题解思路: https://leetcode-cn.com/problems/generate-parentheses/solution/sui-ran-bu-shi-zui-xiu-de-dan-zhi-shao-n-0yt3/