LeetCode 22. Generate Parentheses--Python 解法--广度优先、深度优先解法

题目地址：Generate Parentheses - LeetCode

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:

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

这道题目看起来不难，只要把所有的可能性都输出即可。

可以深度优先，或者广度优先解决。

广度优先的Python解法如下，先输出 ()()()...

class Solution:def generateParenthesis(self, n: int) -> List[str]:def helper(s='', left=0, n=0):if n == 0:self.res.append(s+')'*left)returnif left > 0:helper(s+')', left-1, n)helper(s+'(', left+1, n-1)self.res = []helper('', 0, n)return self.res

深度优先解法如下，先 ((()))

class Solution:def generateParenthesis(self, n: int) -> List[str]:def helper(s='', left=0, n=0):if n == 0:self.res.append(s+')'*left)returnhelper(s+'(', left+1, n-1)if left > 0:helper(s+')', left-1, n)self.res = []helper('', 0, n)return self.res

LeetCode 22. Generate Parentheses--Python 解法--广度优先、深度优先解法相关推荐

[leetcode] 22. Generate Parentheses
题目大意 https://leetcode.com/problems/generate-parentheses/description/ 22. Generate Parentheses Given ...
[LeetCode] #22 Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parenthes ...
LeetCode 22. Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parenthes ...
[leetcode] 22. Generate Parentheses(medium)
原题思路: 利用DFS,搜索每一种情况,同时先加"("后加")",保证()匹配正确. 最近开始学习前端,尝试用js来写. const generate = f ...
22. Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parenthes ...
LeetCode算法入门- Generate Parentheses -day16
LeetCode算法入门- Generate Parentheses -day16 题目描述 Given n pairs of parentheses, write a function to gen ...
[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 42. Trapping Rain Water--算法题--c++解法
LeetCode 42. Trapping Rain Water–c++解法 LeetCode题解专栏:LeetCode题解 LeetCode 所有题目总结:LeetCode 所有题目总结大部分题目 ...
LeetCode 其他部分简单 Python实现
#LeetCode 其他部分简单 Python实现 ''' 位1的个数编写一个函数,输入是一个无符号整数,返回其二进制表达式中数字位数为 '1' 的个数(也被称为汉明重量).示例 : 输入: 11 ...

LeetCode 22. Generate Parentheses--Python 解法--广度优先、深度优先解法

LeetCode 22. Generate Parentheses--Python 解法--广度优先、深度优先解法相关推荐

最新文章

热门文章