【LeetCode 22】Generate Parentheses
2017-02-27 21:52
381 查看
/******************************* 22. Generate Parentheses 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 generate(vector<string> &result,string s,int left,int right) { if (left == 0 && right == 0) result.push_back(s); if (left > 0) { generate(result, s + '(', left - 1, right); } if (right > 0 && left < right) { generate(result, s + ')', left , right-1); } } vector<string> generateParenteses(int n ) { vector<string> result; string s; generate(result,s,n,n); return result; }
相关文章推荐
- LeetCode 22 Generate Parentheses
- LeetCode_22 Generate Parentheses
- 【LeetCode】C# 22、Generate Parentheses
- 【leetcode】【22】Generate Parentheses
- leetcode (22) - Generate Parentheses
- leetcode 22:Generate Parentheses(15-10-9)
- [Leetcode 22, Medium] Generate Parentheses
- [Leetcode]_22 Generate Parentheses
- Leetcode-22: Generate Parentheses
- [leetcode 22]generate parentheses
- LeetCode 22 Generate Parentheses (C,C++,Java,Python)
- Leetcode22 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 卡特兰数问题,有待进一步学习
- Java [leetcode 22]Generate Parentheses