void generate(int n, int l, int r, string paren, vector<string>& parens)
{
if (l == n && r == n)
{
parens.push_back(paren);
}
else
{
if (l < n)
{
generate(n, l + 1, r, paren + '(', parens);
}
if (r < l)
{
generate(n, l, r + 1, paren + ')', parens);
}
}
}
vector<string> generateParenthesis(int n)
{
vector<string> parens;
string paren;
generate(n, 0, 0, paren, parens);
return parens;
}
class Solution {
List< String> res = new ArrayList< > ( ) ;
public List< String> generateParenthesis ( int n) {
dfs ( n, n, "" ) ;
return res;
}
private void dfs ( int left, int right, String curStr) {
if ( left == 0 && right == 0 ) {
res. add ( curStr) ;
return ;
}
if ( left > 0 ) {
dfs ( left - 1 , right, curStr + "(" ) ;
}
if ( right > left) {
dfs ( left, right - 1 , curStr + ")" ) ;
}
}
}