【leetcode】Generate Parentheses
2015-01-22 10:38
351 查看
题目简述:
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:
"((()))", "(()())", "(())()", "()(())", "()()()"
解题思路:
递归,用两个数组分别表示两种括号class Solution: def f(self,res,s,n,m): if n == 0 and m == 0: res.append(s) return if m > 0: self.f(res,s+')',n,m-1) if n > 0: self.f(res,s+'(',n-1,m+1) # @param an integer # @return a list of string def generateParenthesis(self, n): s = '' res = [] self.f(res,s,n,0) return res
如果你觉得内容对你有帮助,请点个赞
您可能也喜欢:【leetcode】Search for a Range
自己实现一个刮刮乐
jquery中ajax的简单使用
git命令汇总
【leetcode】Candy
相关文章推荐
- LeetCode-Generate Parentheses
- LeetCode "Generate Parentheses"
- [LeetCode] Generate Parentheses 生成括号
- LeetCode - Generate Parentheses
- leetcode——22——Generate Parentheses
- Generate Parentheses leetcode java
- leetcode——Generate Parentheses
- LeetCode 22 Generate Parentheses(找到所有匹配的括号组合)
- LeetCode 022 Generate Parentheses
- 【Leetcode】Generate Parentheses (Backtracking)
- LeetCode-Generate Parentheses
- LeetCode(Generate Parentheses)
- leetcode之Generate Parentheses
- [leetcode] 22 Generate Parentheses(递归)
- [leetcode]Generate Parentheses
- LeetCode 21 Generate Parentheses
- 【leetcode】Generate Parentheses
- LeetCode_22 Generate Parentheses
- LeetCode | #22 Generate Parentheses
- LeetCode: Generate Parentheses