给出 n 代表生成括号的对数,请你写出一个函数,使其能够生成所有可能的并且有效的括号组合。
例如,给出 n = 3,生成结果为:
[
"((()))",
"(()())",
"(())()",
"()(())",
"()()()"
]
class Solution:
def generateParenthesis(self, n: int) -> List[str]:
dp = [['']]
for i in range(1, n+1):
temp = []
for j in range(i):
left = dp[j]
right = dp[i-1-j]
for l in left:
for r in right:
temp.append('('+l+')'+r)
dp.append(temp)
return dp[-1]