<p>Given <code>n</code> pairs of parentheses, write a function to <em>generate all combinations of well-formed parentheses</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> n = 3
<strong>Output:</strong> ["((()))","(()())","(())()","()(())","()()()"]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> n = 1
<strong>Output:</strong> ["()"]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= n &lt;= 8</code></li>
</ul>

class Solution {
public:
vector<string>ans;
void ok(string curr,int sumup,int& n){
    if(sumup<0)return;
    if((int)curr.size()>2*n)return ;
    if(sumup==0 && (int)curr.size()==2*n){
        ans.push_back(curr);
        return;

    }
    ok(curr+"(",sumup+1,n);
    ok(curr+")",sumup-1,n);
    return;

}
    vector<string> generateParenthesis(int n) {
        string curr="";
        
        ok(curr,0,n);
        return ans;
        
    }
};
31233