36/100. Generate Parentheses

给定n对括号，要求输出所有合法的括号排列。

使用DFS算法，主要分为两种情况：
①若有剩余的“（”，则添加“（”后继续递归；
②若有剩余的“）”，且“）”的个数多于“（”，即为排好的“（”个数多于“）”，这是判定是否合法的条件，则添加“）”后继续递归。

class Solution(object):def __init__(self):self.res = []def generateParenthesis(self, n):""":type n: int:rtype: List[str]"""self.helper("", n, n)  #n个左括号，n个右括号return self.resdef helper(self, path, left, right):if left == 0 and right == 0:self.res.append(path)if left > 0:self.helper(path+"(", left-1, right)if right > 0 and right > left:  self.helper(path+")", left, right-1)

36/100. Generate Parentheses相关推荐

[leetcode] 22. Generate Parentheses
题目大意 https://leetcode.com/problems/generate-parentheses/description/ 22. Generate Parentheses Given ...
[CareerCup] 9.6 Generate Parentheses 生成括号
9.6 Implement an algorithm to print all valid (e.g., properly opened and closed) combinations of n-p ...
LeetCode算法入门- Generate Parentheses -day16
LeetCode算法入门- Generate Parentheses -day16 题目描述 Given n pairs of parentheses, write a function to gen ...
LeetCode:Generate Parentheses
题目链接 Given n pairs of parentheses, write a function to generate all combinations of well-formed pare ...
LeetCode Generate Parentheses
原题链接在这里:https://leetcode.com/problems/generate-parentheses/ 题目: Given n pairs of parentheses, write ...
【LeetCode每天一题】Generate Parentheses(创造有效的括弧)
Given n pairs of parentheses, write a function to generate all combinations of well-formed parenthes ...
【LeetCode从零单排】No22.Generate Parentheses
题目 Given n pairs of parentheses, write a function to generate all combinations of well-formed parent ...
Generate Parentheses
描述 Given n pairs of parentheses, write a function to generate all combinations of wellformed parenth ...
22. Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parenthes ...

36/100. Generate Parentheses

36/100. Generate Parentheses相关推荐

最新文章

热门文章