数字 n
代表生成括号的对数,请你设计一个函数,用于能够生成所有可能的并且 有效的 括号组合。
示例 1:
输入:n = 3 输出:["((()))","(()())","(())()","()(())","()()()"]
示例 2:
输入:n = 1 输出:["()"]
提示:
1 <= n <= 8
class Solution{
private:
string buffer = "";
vector<string> res = {};
void backtrack(int n, int left, int right){
if (buffer.size() == 2*n) res.push_back(buffer);
else {
if(left < n) {
buffer.push_back('(');
backtrack(n, left+1, right);
buffer.pop_back();
}
if(right < left) {
buffer.push_back(')');
backtrack(n, left, right+1);
buffer.pop_back();
}
}
return;
}
public:
vector<string> generateParenthesis(int n) {
backtrack(n, 0, 0);
return res;
}
};
4 ms 70.52%
11.6 MB 59.3%