给出 n 代表生成括号的对数,请你写出一个函数,使其能够生成所有可能的并且有效的括号组合。
例如,给出 n = 3,生成结果为:
[ "((()))", "(()())", "(())()", "()(())", "()()()" ]
class Solution {
public:
vector<string> generateParenthesis(int n) {
int left=n,right=n;
vector<string> result;
string test = "";
generateParenthesiscore(left,right,result,test);
return result;
}
private:
void generateParenthesiscore(int left,int right,vector<string> &result,string test)
{
if(left>right)
return;
if(left==0&&right==0)
result.push_back(test);
else
{
if(left>0)
generateParenthesiscore(left-1,right,result,test+'(');
if(right>0)
generateParenthesiscore(left,right-1,result,test+')');
}
}
};