Leetcode---Generate Parentheses
来源:互联网 发布:淘宝换货售后卡怎么填 编辑:程序博客网 时间:2024/06/06 23:55
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:
"((()))", "(()())", "(())()", "()(())", "()()()"
括号问题,要算输出个数的话是卡特兰数,要输出所有情况的话是递归。
这道题关键在递归参数的选择上,仔细想来,一定得是左右括号的数量,以及括号字符串的中间结果,
代码如下:
void f(int n, int l,int r,string s){ if(l==n&&r==n){ result.push_back(s); return; } if(l>r){ f(n,l,r+1,s+")"); } if(l<n) f(n,l+1,r,s+"(");}vector<string> generateParenthesis(int n){ f(n,0,0,""); return result;}
0 0
- LeetCode: Generate Parentheses
- LeetCode: Generate Parentheses
- [Leetcode] Generate Parentheses
- leetcode 51: Generate Parentheses
- [LeetCode] Generate Parentheses
- Leetcode: Generate Parentheses
- LeetCode Generate Parentheses
- 【leetcode】Generate Parentheses
- [LeetCode]Generate Parentheses
- Leetcode Generate Parentheses
- LeetCode-Generate Parentheses
- LeetCode: Generate Parentheses
- LeetCode - Generate Parentheses
- LeetCode 22: Generate Parentheses
- LeetCode: Generate Parentheses
- Leetcode: Generate Parentheses
- 【leetcode】Generate Parentheses
- Leetcode: Generate Parentheses
- MySQL数据库中索引原理与数据结构
- earlier need to also include a Launch Image in an Asset Catalog.
- 算法设计与分析之动态规划法
- php 加xml创建小型客户关系管理登陆系统
- 动态规划
- Leetcode---Generate Parentheses
- CRT函数相关问题,gets_s和strcpy_s的用法
- 黑马程序员——C语言——C语言程序编写
- c++模板元编程六:integral_constant 类
- 【Android开发】高级组件-拖动条和星级评分条
- C++虚函数调用
- 哥德巴赫猜想的测试及分析
- 黑马程序员——C语言——计算机和软件基本常识
- hdoj 1395 2^x mod n = 1