Leetcode 22. Generate Parentheses (Medium) (cpp)

最新推荐文章于 2022-02-16 15:59:17 发布

Niko_Ke

最新推荐文章于 2022-02-16 15:59:17 发布

阅读量387

点赞数

本文链接：https://blog.csdn.net/Niko_Ke/article/details/52268102

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode String

34 篇文章 0 订阅

订阅专栏

Leetcode 22. Generate Parentheses (Medium) (cpp)

Tag: Backtracking, String

Difficulty: Medium

/*

22. Generate Parentheses (Medium)

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;
        string s;
        generate(n, n, res, s);
        return res;
    }
    void generate(int p, int q, vector<string>& res, string s) {
        if (!p) {
            if (q) {
                s.push_back(')');
                generate(0, q - 1, res, s);
            } else {
                res.push_back(s);
                return;
            }
        } else if (p == q) {
            s.push_back('(');
                generate(p - 1, q, res, s);
            } else {
                s.push_back('(');
                    generate(p - 1, q, res, s);
                    s.pop_back();
                    s.push_back(')');
                    generate(p, q - 1, res, s);
                    s.pop_back();
                }
            }
        };