Leetcode 22. 괄호 생성

설명

예 1:

Input: n = 3
Output: ["((()))","(()())","(())()","()(())","()()()"]

예 2:

Input: n = 1
Output: ["()"]

해결책:

// function to return answer and adds the params to the 
// recursive backtracking function 
function setup(n) {
    // answer to return
    // recursive backtrack(answer, emptyCombination);
    // return answer;
};

function backtrack(ans, curentCombination) {
    // if (base case) {
    //   add curentCombination to answer
    //}

    // logic for recursive call to add items 
    // to curentCombination
}

    if (cur.length == max * 2) {
        ans.push(cur);
        return;
    }

    if (open < max)
        backtrack(ans, cur+"(", open+1, close, max)

    if (close < open)
        backtrack(ans, cur+")", open, close+1, max);

 var generateParenthesis = function(n) {
    const ans = [];
    backtrack(ans, "", 0, 0, n);
    return ans;
};

전체 솔루션

 var generateParenthesis = function(n) {
    const ans = [];
    backtrack(ans, "", 0, 0, n);
    return ans;
};

function backtrack(ans, cur, open, close, max) {
    if (cur.length == max * 2) {
        ans.push(cur);
        return;
    }

    if (open < max)
        backtrack(ans, cur+"(", open+1, close, max);
    if (close < open)
        backtrack(ans, cur+")", open, close+1, max);
}