22. Generate Parentheses LeetCode
来源:互联网 发布:js判断div滚动条 编辑:程序博客网 时间:2024/04/30 21:14
题意:给出括号的数目,求所有合法的括号表示。
题解:递归,先递归左括号,再递归右括号。
class Solution {public: void dfs(int l,int r,string res,vector<string>& ans) { if(l < 0 || r < 0 || l > r) return ; if(l == 0 && r == 0) ans.push_back(res); dfs(l - 1, r, res + "(", ans); dfs(l, r - 1, res + ")", ans); } vector<string> generateParenthesis(int n) { vector<string> ans; dfs(n,n,"",ans); return ans; }};
0 0
- [LeetCode]22.Generate Parentheses
- LeetCode --- 22. Generate Parentheses
- LeetCode 22.Generate Parentheses
- [Leetcode] 22. Generate Parentheses
- 【LeetCode】22.Generate Parentheses
- [leetcode] 22.Generate Parentheses
- 【leetcode】22. Generate Parentheses
- Leetcode-22.Generate Parentheses
- [leetcode] 22. Generate Parentheses
- 22. Generate Parentheses LeetCode
- leetcode 22. Generate Parentheses
- [LeetCode]22. Generate Parentheses
- leetcode 22. Generate Parentheses
- leetcode 22. Generate Parentheses
- LeetCode 22. Generate Parentheses
- [LeetCode]22. Generate Parentheses
- LeetCode *** 22. Generate Parentheses
- LeetCode 22. Generate Parentheses
- 循环链表
- 230. Kth Smallest Element in a BST LeetCode
- SqlServer 数据页损坏还原测试
- 最全面的65条最常用正则表达式
- Cornerstone的创建分支Branch
- 22. Generate Parentheses LeetCode
- Linux 下的自解压工具
- Codeforces 8VC Venture Cup 2016 - Elimination Round解题报告
- Linux学习笔记--cp命令(复制)
- 153. Find Minimum in Rotated Sorted Array LeetCode
- 新年搬新家
- WEP协议加密解密过程详解
- Android异步任务处理
- ASCII编码和Unicode编码