LeetCode: Generate Parentheses
2015-04-14 14:54
302 查看
Title:
https://leetcode.com/problems/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:
思路:DFS搜索。每次首先是(,然后是)。用两个值表示(括号当前可以用的数目n和)括号当前可用的数目m。)可以使用的前提是m>n
https://leetcode.com/problems/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:
"((()))", "(()())", "(())()", "()(())", "()()()"
思路:DFS搜索。每次首先是(,然后是)。用两个值表示(括号当前可以用的数目n和)括号当前可用的数目m。)可以使用的前提是m>n
vector<string> generateParenthesis(int n){ vector<string> result; if (n == 0) return result; string s; generate(result,s,n,n); return result; } void generate(vector<string> & result,string s, int n,int m){ if (n == 0 && m == 0){ result.push_back(s); } if (n > 0){ generate(result,s+'(',n-1,m); } if (n < m && m > 0){ generate(result,s+')',n,m-1); } }
相关文章推荐
- LeetCode 22 Generate Parentheses
- N-Queens And N-Queens II [LeetCode] + Generate Parentheses[LeetCode] + 回溯法
- Generate Parentheses 【Leetcode】
- leetcode-22-Generate Parentheses
- [LeetCode]Generate Parentheses
- Generate Parentheses -- leetcode
- LeetCode_Generate Parentheses
- [Java]LeetCode22 Generate Parentheses
- [leetcode]Generate Parentheses
- 【leetcode】Generate Parentheses
- 【Leetcode】Generate Parentheses
- 【leetcode】Generate Parentheses
- [LeetCode]Generate Parentheses
- leetcode (22) - Generate Parentheses
- LeetCode 22 Generate Parentheses (C,C++,Java,Python)
- 【leetcode】Generate Parentheses
- Leetcode-Generate Parentheses
- [Leetcode] 22- Generate Parentheses
- 【leetcode】Generate Parentheses
- leetcode之 Generate Parentheses