leetcode记录22. Generate Parentheses

hinanmu

于 2019-05-01 19:48:28 发布

阅读量127

点赞数

本文链接：https://blog.youkuaiyun.com/csdn_47/article/details/89739953

版权

leetcode 专栏收录该内容

37 篇文章

订阅专栏

博客围绕“Generate Parentheses”展开，虽未详细阐述具体内容，但核心聚焦于此问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

22. Generate Parentheses

Runtime: 8 ms, faster than 97.28% of C++ online submissions for Generate Parentheses.
Memory Usage: 17.8 MB, less than 15.18% of C++ online submissions for Generate Parentheses.

class Solution {
public:
    vector<string> generateParenthesis(int n) {
        generate(0, 0, "", n);
        return result;
    }
    
    int generate(int left,int right,string s,int n)
    {
        if(left==n && right == n)
        {
            result.push_back(s);
        }
        else
        {
            int l = left;
            if(left < n)
            {
                generate(++left, right, s + "(", n);
            }
            if(l > right)
            {
                generate(l, ++right, s + ")", n);
            }
        }
        return 0;
    }
private: 
    vector<string> result;
};