Leetcode-Generate Parentheses(递归）

最新推荐文章于 2021-02-25 17:37:50 发布

forest小拳拳

最新推荐文章于 2021-02-25 17:37:50 发布

阅读量261

点赞数

分类专栏： Leetcode 文章标签： Leetcode 递归

本文链接：https://blog.youkuaiyun.com/qq_33097439/article/details/72972117

版权

Leetcode 专栏收录该内容

97 篇文章

订阅专栏

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> res;
        addinger(res,"",n,0);
        return res;
    }
    void addinger(vector<string> &v,string str,int n,int m){
        if(n==0&&m==0){
            v.push_back(str);
            return;
        }
        if(m>0)
        addinger(v,str+")",n,m-1);
        if(n>0)
        addinger(v,str+"(",n-1,m+1);
    }
    
};