題目連結

基本爆搜題

AC Code

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
class Solution
{
private:
    void dfs(int n, int i, int l, int r, string &s, vector<string> &ans)
    {
        if (n * 2 == i) {
            ans.push_back(s);
            return;
        }

        if (l < n) {
            s += "(";
            dfs(n, i + 1, l + 1, r, s, ans);
            s.pop_back();
        }

        if (r < n && l > r) {
            s += ")";
            dfs(n, i + 1, l, r + 1, s, ans);
            s.pop_back();
        }
    }

public:
    vector<string> generateParenthesis(int n)
    {
        string s;
        vector<string> ans;

        dfs(n, 0, 0, 0, s, ans);

        return ans;
    }
};