LeetCode Generate Parentheses

來源:互聯網
上載者:User

標籤:style   blog   color   io   for   re   

class Solution {public:    vector<string> generateParenthesis(int n) {        string str;        vector<string> res;        dfs(n, 0, 0, str, res);        return res;    }    void dfs(int n, int L, int R, string str, vector<string> &res) {        if (str.size() == n<<1) {            res.push_back(str);            return;        }        int len = str.length();        for (int i = L + 1; i <= n; i++) {            dfs(n, i, R, str + "(", res);        }        for (int i = R + 1; i <= n && R < L; i++) {            dfs(n, L, i, str +")", res);        }    }};

dfs暴力搜尋,800ms+應該可以改進

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.