题目
正整数 n 代表生成括号的对数,请设计一个函数,用于能够生成所有可能的并且 有效的 括号组合。
示例
输入:n = 3
输出:["((()))","(()())","(())()","()(())","()()()"]
输入:n = 1
输出:["()"]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/IDBivT
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
方法1:回溯
Java实现
class Solution {
List<String> res = new ArrayList<>();
public List<String> generateParenthesis(int n) {
StringBuffer track = new StringBuffer();
track_back(n, n, track);
return res;
}
public void track_back(int left, int right, StringBuffer track){
if (left > right) return;
if (left < 0 || right < 0) return;
if (left == 0 && right == 0) {
res.add(track.toString());
return;
}
track.append("(");
track_back(left - 1, right, track);
track.deleteCharAt(track.length() - 1);
track.append(")");
track_back(left, right - 1, track);
track.deleteCharAt(track.length() - 1);
}
}