题目:
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:
“((()))”, “(()())”, “(())()”, “()(())”, “()()()”
Solution:
代码如下:
vector<string> generateParenthesis(int n)
{
vector<string> result;
string s ="";
generate(n,n,s,result);
return result;
}
void generate(int left_num,