数字 n 代表生成括号的对数,请你设计一个函数,用于能够生成所有可能的并且 有效的 括号组合。
示例 1:
输入:n = 3
输出:["((()))","(()())","(())()","()(())","()()()"]
示例 2:
输入:n = 1
输出:["()"]
提示:
1 <= n <= 8
如果是有效的括号组合,则左括号的数量=右括号的数量=n。
从左到右遍历所有的括号组合的过程中,如果有左括号的数量≥右括号的数量,则递归继续,如果有左括号的数量<右括号的数量,则递归退出。
回溯算法
c++实现
class Solution {
public:
vector<string> generateParenthesis(int n) {
vector<string> result;
string current;
backtracking(n,result,0,0,current);
return result;
}
void backtracking(int n,vector<string>&result,int left,int right,string str)
{
if(right>left)
{return;}
if(left==n&&right==n)
{
result.push_back(str);
return;
}
if(left<n)
{
str.push_back('(');
backtracking(n,result,left+1,right,str);
str.pop_back();
}
if(right<left)
{
str.push_back(')');
backtracking(n,result,left,right+1,str);
str.pop_back();
}
}
};
java实现
class Solution {
public List<String> generateParenthesis(int n) {
List<String> result=new ArrayList<>();
backtracking(n,result,0,0,"");
return result;
}
private void backtracking(int n,List<String> result,int left,int right,String str)
{
if(right>left)
{return;}
if(left==n&&right==n)
{
result.add(str);
return;
}
if(left<n)
{
backtracking(n,result,left+1,right,str+"(");
}
if(right<left)
{
backtracking(n,result,left,right+1,str+")");
}
}
}
剪枝策略
c++实现
class Solution {
public:
vector<string> generateParenthesis(int n) {
vector<string> res;
if (n <= 0) return res;
dfs(n, "", res, 0, 0);
return res;
}
void dfs(int n, string path, vector<string>& res, int open, int close) {
if (open > n || close > open) return;
if (path.length() == 2 * n) {
res.push_back(path);
return;
}
dfs(n, path + "(", res, open + 1, close);
dfs(n, path + ")", res, open, close + 1);
}
};