/*
模型:()()() 3(左括号数量L),3(右括号数量R)
2,3 (
1,3( )2,2
0,3( )1,2 (1,2
0,2( )1,1 0,2( )1,1
0,1) )0,1 0,1) (0,1
0,0) )0,0 0,0) )0,0
由上图可以看出 要想括号的顺序对 左括号的数量一定是小于右括号的数量
所以遍历的拆解步骤是l大于0 写“(”入结果里面-》递归-》把结果删除-》如果l<r 写“)”入结果里面—》递归
出口在l=0并且r=0的时候;把结果写入list里面;
*/
class Solution {
public List<String> generateParenthesis(int n) {
List<String> resultList = new ArrayList<>();
if(n == 0) return resultList;
StringBuilder result = new StringBuilder();
int L = n;
int R = n;
helper(L, R, resultList, result);
return resultList;
}
private void helper(int L, int R, List<String> resultList, StringBuilder result) {
if(L == 0 && R == 0) {
resultList.add(new String(result.toString()));
return;
}
if(L > 0) {
result.append('(');
helper(L - 1, R, resultList, result);
result.deleteCharAt(result.length() - 1);
}
if(L > 0 &&L < R) {
result.append(')');
helper(L, R - 1, resultList, result);
result.deleteCharAt(result.length() - 1);
}
}
}
模型:()()() 3(左括号数量L),3(右括号数量R)
2,3 (
1,3( )2,2
0,3( )1,2 (1,2
0,2( )1,1 0,2( )1,1
0,1) )0,1 0,1) (0,1
0,0) )0,0 0,0) )0,0
由上图可以看出 要想括号的顺序对 左括号的数量一定是小于右括号的数量
所以遍历的拆解步骤是l大于0 写“(”入结果里面-》递归-》把结果删除-》如果l<r 写“)”入结果里面—》递归
出口在l=0并且r=0的时候;把结果写入list里面;
*/
class Solution {
public List<String> generateParenthesis(int n) {
List<String> resultList = new ArrayList<>();
if(n == 0) return resultList;
StringBuilder result = new StringBuilder();
int L = n;
int R = n;
helper(L, R, resultList, result);
return resultList;
}
private void helper(int L, int R, List<String> resultList, StringBuilder result) {
if(L == 0 && R == 0) {
resultList.add(new String(result.toString()));
return;
}
if(L > 0) {
result.append('(');
helper(L - 1, R, resultList, result);
result.deleteCharAt(result.length() - 1);
}
if(L > 0 &&L < R) {
result.append(')');
helper(L, R - 1, resultList, result);
result.deleteCharAt(result.length() - 1);
}
}
}