[leetcode]Generate Parentheses

Generate Parentheses

 

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:

"((()))", "(()())", "(())()", "()(())", "()()()"

解题思路：卡特兰数变形

void innerGenerateParenthesis(vector<string> &vs, string &str, int lc, int rc, int n){
   	if(lc == n && rc == n){
   		vs.push_back(str);
   		return;
   	}
   	if(lc < n){
		str.push_back('(');
   		innerGenerateParenthesis(vs, str, lc + 1, rc, n);
		str.pop_back();
   	}
   	if(rc < n && rc < lc){//入栈的左括号一定要大于等于右括号数
		str.push_back(')');
		innerGenerateParenthesis(vs, str, lc, rc + 1, n);
   		str.pop_back();
   	}
}
vector<string> generateParenthesis(int n) {
    // IMPORTANT: Please reset any member data you declared, as
    // the same Solution instance will be reused for each test case.
   	vector<string> vs;
   	string str; //暂存变量
   	innerGenerateParenthesis(vs, str, 0, 0, n);
   	return vs;
}