# -*- coding: utf-8 -*-
'''
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
For example, given n = 3, a solution set is:
[
"((()))",
"(()())",
"(())()",
"()(())",
"()()()"
]
解题思路:
使用两个整数计算左括号(n)和右括号(m),在每个函数调用时,如果n>0,就添加一个左括号且m+1,n-1;
如果m>0,就添加一个右括号且m-1,n保持不变。
先调用左括号。
'''
class Solution(object):
def generateParenthesis(self, n):
"""
:type n: int
:rtype: List[str]
"""
def addPar(res,s,n,m):
if n==0 and m==0:
res.append(s)
return
if m>0:
addPar(res,s+')',n,m-1)
if n>0:
addPar(res,s+'(',n-1,m+1)
res=[]
addPar(res,'',n,0)
return res
mypar=Solution()
print mypar.generateParenthesis(3)
generate parentheses
最新推荐文章于 2023-06-15 12:30:47 发布