首页 > 代码库 > [leetcode-22-Generate Parentheses]
[leetcode-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:
[
"((()))",
"(()())",
"(())()",
"()(())",
"()()()"
]
思路:
DFS.
void addParenthesis(vector<string>& res, string str, int open, int close,int n) { if (str.length() == n*2) { res.push_back(str); return; } if (open<n)addParenthesis(res, str + "(", open + 1, close, n); if (close < open)addParenthesis(res, str + ")", open, close + 1, n); } vector<string> generateParenthesis(int n) { vector<string>res; addParenthesis(res, "", 0, 0, n); return res; }
参考:
https://discuss.leetcode.com/topic/4485/concise-recursive-c-solution
[leetcode-22-Generate Parentheses]
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。