LeetCode-Generate Parentheses

来源:互联网 发布:sql select case语句 编辑:程序博客网 时间:2024/04/29 16:58

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

For example, given n = 3, a solution set is:

"((()))", "(()())", "(())()", "()(())", "()()()"

Solution:

Code:

<span style="font-size:14px;">class Solution {public:    void generater(int left, int right, vector<string> &results, string str, const int &n) {        if (left == n && right == n) {            results.push_back(str);            return;        }        if (left < right) return;        if (left < n) generater(left+1, right, results, str+"(", n);        if (right < n) generater(left, right+1, results, str+")", n);    }        vector<string> generateParenthesis(int n) {        vector<string> results;        generater(0, 0, results, "", n);        return results;    }};</span>



0 0
原创粉丝点击