地址:https://leetcode.cn/problems/IDBivT/
题目描述:
代码:
class Solution {
public List<String> generateParenthesis(int n) {
dfs(n,"",0,0);
return list;
}
List<String> list=new LinkedList();
public void dfs(int n,String s,int l,int r ) {
if(r>l) //右括号的数量大于左边 提前结束递归
return ;
if((l==n)&& (l==r))
list.add(s);
if((l>n)||(r>n)){
return ;
}
dfs(n,s+"(",l+1,r);
dfs(n,s+")",l,r+1);
}
}