[LeetCode][JavaScript]Generate Parentheses

Generate Parentheses 

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:

"((()))", "(()())", "(())()", "()(())", "()()()"

https://leetcode.com/problems/generate-parentheses/

---

只有两个节点的bfs

/**
 * @param {number} n
 * @return {string[]}
 */
var generateParenthesis = function(n) { 
    var res = [];
    bfs("", 0, 0);
    return res;

    function bfs(tmpStr, countL, countR){
        if(countL === n && countR === n){
            res.push(tmpStr);
            return;
        }
        if(countL !== n ){
            bfs(tmpStr + "(", countL + 1, countR);
        }
        if(countL > countR){
            bfs(tmpStr + ")", countL, countR + 1);
        }
    }
};