数字 n 代表生成括号的对数,请你设计一个函数,用于能够生成所有可能的并且 有效的 括号组合。
示例 1:
输入: n = 3
输出: ["((()))","(()())","(())()","()(())","()()()"]
示例 2:
输入: n = 1
输出: ["()"]
提示:
1 <= n <= 8
解题答案
class Solution {
private char[] string;
private List<String> result;
public List<String> generateParenthesis(int n) {
result = new ArrayList<>();
string = new char[n << 1];
dfs(0, n, n);
return result;
}
private void dfs(int idx, int leftRemain, int rightRemain) {
if (idx == string.length) {
result.add(new String(string));
return;
}
if (leftRemain > 0) {
string[idx] = '(';
dfs(idx+1, leftRemain - 1, rightRemain);
}
if (leftRemain < rightRemain) {
string[idx] = ')';
dfs(idx+1, leftRemain, rightRemain - 1);
}
}
}