难度:中等
数字
n
代表生成括号的对数,请你设计一个函数,用于能够生成所有可能的并且 有效的 括号组合。示例 1:
输入:n = 3 输出:["((()))","(()())","(())()","()(())","()()()"]示例 2:
输入:n = 1 输出:["()"]提示:
1 <= n <= 8
代码(回溯法):
class Solution {
public List<String> generateParenthesis(int n) {
List<String> result = new ArrayList<>();
backtrack(result, new StringBuffer(), 0, 0, n);
return result;
}
private void backtrack(List<String> res, StringBuffer sb, int left, int right, int n) {
if (left + right == 2 * n) {
res.add(sb.toString());
return;
}
//当左括号小于总数(即还可以再添加左括号时)
if (left < n) {
sb.append('(');
backtrack(res, sb, left + 1, right, n);
//删除刚刚添加的左括号,不影响回溯
sb.deleteCharAt(sb.length() - 1);
}
//当右括号少于左括号时
if (right < left) {
sb.append(')');
backtrack(res, sb, left, right + 1, n);
sb.deleteCharAt(sb.length() - 1);
}
}
}