Leetcode--Generate Parentheses
来源:互联网 发布:嘉兴市行知小学 编辑:程序博客网 时间:2024/06/05 18:30
Problem Description:
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 {public: vector<string> res; void dfs(int n,int left,int right, string str) { if(left==right&&left==n) { res.push_back(str); return; } if(left<right||left>n) return; else { str+='('; dfs(n,left+1,right,str); str=str.substr(0,str.size()-1); str+=')'; dfs(n,left,right+1,str); str=str.substr(0,str.size()-1); } } vector<string> generateParenthesis(int n) { if(n<=0) return res; string s=""; dfs(n,0,0,s); return res; }};
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
- karaf中利用Bundle引入外部log4j配置文件
- 使用Android模拟器拨打电话
- java实习——8.8
- Properties读写配置文件
- 二叉树的遍历
- Leetcode--Generate Parentheses
- Rightmost Digit
- 有时候
- poj 1323 Game Prediction
- javascript中的正则表达式
- 机器学习实战笔记4(朴素贝叶斯)
- 机房收费系统——需求分析(初期)
- HDOJ 题目3389 Game(阶梯博弈)
- extern "C"的用法