LeetCode 22. Generate Parentheses 回溯 backtrack

最新推荐文章于 2021-06-17 00:55:33 发布

taoqick

最新推荐文章于 2021-06-17 00:55:33 发布

阅读量158

点赞数

分类专栏：算法 leetcode

本文链接：https://blog.csdn.net/taoqick/article/details/107003369

版权

算法同时被 2 个专栏收录

474 篇文章 6 订阅

订阅专栏

leetcode

231 篇文章 0 订阅

订阅专栏

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:

[
  "((()))",
  "(()())",
  "(())()",
  "()(())",
  "()()()"
]

------------------------------

Simple codes:

class Solution:
    def generateParenthesis(self, n: int) -> List[str]:
        res = []
        def backtrack(p, left, right):
            nonlocal res
            if (left > 0):
                backtrack(p + "(", left-1, right)
            if (left < right):
                backtrack(p + ")", left, right-1)
            if (right == 0):
                res.append(p)
        backtrack("", n, n)
        return res