<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:
    void generate(int ind, int n,int cnt,int check,string s, vector<string>&ans){
        if(ind==n){
            ans.push_back(s);
            return;
        }
        if(check<n/2){
            s+='(';
            generate(ind+1,n,cnt+1,check+1,s,ans);
            s.pop_back();
        }

        if(cnt>0){
            s+=')';
            generate(ind+1,n,cnt-1,check,s,ans);
            s.pop_back();
        }

    }

    vector<string> generateParenthesis(int n) {
        vector<string> ans;
        string s="";
        generate(0,2*n,0,0,s,ans);
        return ans;
    }
};
16045