[LeetCode] Generate Parentheses

最新推荐文章于 2018-02-24 19:45:54 发布

hale1007

最新推荐文章于 2018-02-24 19:45:54 发布

阅读量389

点赞数

分类专栏： Algorithm LeetCode

本文链接：https://blog.csdn.net/hale1007/article/details/25408593

版权

Algorithm 同时被 2 个专栏收录

86 篇文章 0 订阅

订阅专栏

LeetCode

76 篇文章 0 订阅

订阅专栏

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:

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

class Solution {
public:
    vector<string> generateParenthesis(int n) {
        vector<string> result;
        generate(n, 0, 0, "", result);
        return result;
    }
    void generate(int n, int l, int r, string temp, vector<string> &result)
    {
        if(l + r == 2 * n)
        {
            if(l == r)
                result.push_back(temp);
            return;
        }
        if(l < r)   return;
        generate(n, l + 1, r, temp + '(', result);
        generate(n, l, r + 1, temp + ')', result);
    }
};