22.generate-parentheses.cpp

/*
 * @lc app=leetcode id=22 lang=cpp
 *
 * [22] Generate Parentheses
 *
 * https://leetcode.com/problems/generate-parentheses/description/
 *
 * algorithms
 * Medium (70.53%)
 * Likes:    14511
 * Dislikes: 547
 * Total Accepted:    1.2M
 * Total Submissions: 1.6M
 * Testcase Example:  '3'
 *
 * Given n pairs of parentheses, write a function to generate all combinations
 * of well-formed parentheses.
 * 
 * 
 * Example 1:
 * Input: n = 3
 * Output: ["((()))","(()())","(())()","()(())","()()()"]
 * Example 2:
 * Input: n = 1
 * Output: ["()"]
 * 
 * 
 * Constraints:
 * 
 * 
 * 1 <= n <= 8
 * 
 * 
 * n == 1: ["()"]
 * n == 2: ["()()","(())"]
 * n == 3: ["()()()","((()))","(())()","()(())","(()())"]
 * 
 */

// @lc code=start
class Solution {
public:

    vector<string> myans = {"()"};
    void parenthesis(int n){
        if 
        return;
    }

    vector<string> generateParenthesis(int n) {
        parenthesis(n);
        return myans;
    }
};
// @lc code=end