Generate Parentheses

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

Nereus_Li

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

阅读量519

点赞数

分类专栏： LeetCode 文章标签： string 递归

本文链接：https://blog.csdn.net/li_chihang/article/details/44803523

版权

LeetCode 专栏收录该内容

113 篇文章 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:

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

#include<iostream>
#include<vector>
#include<string>

using namespace std;
void creatpath(vector<string>&Result,string &path,int lnum,int rnum)
{
	if (lnum==0&&rnum==0){
		Result.push_back(path);
		return;
	}
	if (lnum>0)
		creatpath(Result,path+"(",lnum-1,rnum+1);
	if (rnum>0)
		creatpath(Result,path+")",lnum,rnum-1);
}

vector<string> generateParenthesis(int n) {
	vector<string>Result;
	string path;
	creatpath(Result,path,n,0);
	return Result;
}