IT_World
[leetcode] 22. Generate Parentheses 본문
class Solution:
def generateParenthesis(self, n: int) -> List[str]:
'''
type n = int
'''
self.res = []
self.helper("",n,n)
return self.res
def helper(self, current,left, right) :
if right == 0:
self.res.append(current)
else :
if left > 0:
self.helper(current + "(", left-1, right)
if left < right :
self.helper(current + ")", left, right-1)
'Coding test > programmers - single' 카테고리의 다른 글
[leetcode]77. Combinations (0) | 2022.03.31 |
---|---|
[leetcode]78. Subsets (0) | 2022.03.30 |
[leetcode] 67. Add Binary (0) | 2022.03.27 |
[leetcode] 53. Maximum Subarray (0) | 2022.03.26 |
[leetcode] 2. Add Two Numbers (1) | 2022.03.24 |
Comments