LeetCode 22 Generate Parentheses（生成括号）

翻译

给定一个括号序列，写一个函数用于生成正确形式的括号组合。
例如，给定n = 3，一个解决方案集是：
"((()))", "(()())", "(())()", "()(())", "()()()"

原文

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> result;
vector<string> generateParenthesis(int n) {
generate(0, 0, "", n);
return result;
}
void generate(int left, int right, string s, int n) {
if(right == n) {
result.push_back(s);
}
else
{
if(left < n)
{
generate(left + 1, right, s + "(", n);
}
if(right < left)
{
generate(left, right + 1, s + ")", n);
}
}
}
};