https://leetcode.cn/problems/generate-parentheses/description/
刚接触到这个题时我首先想到的就是回溯法(也算有些进步了)。
非常清晰,在每一步有多个选择,而且每个选择都走到底,是经典的回溯问题。
class Solution {
public:
vector<string> generateParenthesis(int n) {
vector<string> result;
dfs(n, n, "", result);
return result;
}
void dfs(int left, int right, string current, vector<string>& result) {
if (left == 0 && right == 0) {
result.push_back(current);
return;
}
if (left > 0) {
dfs(left - 1, right, current + "(", result);
}
if (right > left) {
dfs(left, right - 1, current + ")", result);
}
}
};