Generate Parentheses

最新推荐文章于 2022-05-10 19:05:11 发布

Pango_lulu

最新推荐文章于 2022-05-10 19:05:11 发布

阅读量386

点赞数

分类专栏： Leetcode 文章标签：回溯法 string

本文链接：https://blog.csdn.net/pango_cs/article/details/43779899

版权

Leetcode 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

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:

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

Tag：使用回溯法。

queue<char> q;
int left_num;
int right_num;

void help(vector<string> &ans, string str, int n)
{
	if(str.size() == 2 * n)
	{
		ans.push_back(str);
		return;
	}

	if(left_num < n)
	{
		left_num++;
		q.push('(');
		str.push_back('(');
		help(ans, str, n);
		left_num--;
		q.pop();
		str = str.substr(0, str.size() - 1);
	}

	if(right_num < n && (!q.empty() && q.front() == '('))
	{
		right_num++;
		q.pop();
		str.push_back(')');
		help(ans, str, n);
		right_num--;
		q.push('(');
		str = str.substr(0, str.size() - 1);
	}
}

vector<string> generateParenthesis(int n)
{
	//q.clear();
	left_num = 0;
	right_num = 0;
	vector<string> ans;
	string str;
	help(ans, str, n);
	return ans;
}

int main()
{
	/* code */
	vector<string> ans = generateParenthesis(3);
	for(int i = 0; i < ans.size(); i++)
	{
		cout<<ans[i]<<endl;
	}
	return 0;
}