力扣---22. 括号生成

数字 n 代表生成括号的对数，请你设计一个函数，用于能够生成所有可能的并且 有效的 括号组合。

示例 1：

输入：n = 3
输出：["((()))","(()())","(())()","()(())","()()()"]

示例 2：

输入：n = 1
输出：["()"]

提示：

• 1 <= n <= 8

class Solution {
public:
     void generateParenthesisHelper(int n, int open, int close, string current, vector<string> &result) {
        if (current.length() == n * 2) {
            result.push_back(current);
            return;
        }
        
        if (open < n) {
            generateParenthesisHelper(n, open + 1, close, current + "(", result);
        }
        
        if (close < open) {
            generateParenthesisHelper(n, open, close + 1, current + ")", result);
        }
    }
    
    vector<string> generateParenthesis(int n) {
        vector<string> result;
        generateParenthesisHelper(n, 0, 0, "", result);
        return result;
    }
};