Update 0022-generate-parentheses.js

Author: aakhtar3

javascript/0022-generate-parentheses.js

@@ -1,14 +1,15 @@
 /**
- * https://leetcode.com/problems/generate-parentheses
+ * DFS
  * Time O(((4^N) / (N * SQRT(N)))) | Space O(((4^N) / (N * SQRT(N))))
  * Time O(2^N) | Space O(2^N)
+ * https://leetcode.com/problems/generate-parentheses
  * @param {number} n
  * @return {string[]}
  */
-var generateParenthesis = (n) => dfs(n);/* Time O(2^N) | Space O(2^N) */
+var generateParenthesis = (n) => dfs(n);
 
 const dfs = (n, combos = [], open = 0, close = 0, path = []) => {
-    const isBaseCase = path.length === (n * 2);
+    const isBaseCase = (path.length === (n * 2));
     if (isBaseCase) {
         combos.push(path.join(''));/* Space O(N + N) */
 
@@ -25,35 +26,36 @@ const dfs = (n, combos = [], open = 0, close = 0, path = []) => {
 }
 
 const backTrackOpen = (n, combos, open, close, path) => {
-    path.push('(');                             /*             | Space O(N) */
+    path.push('(');/* Space O(N) */
         dfs(n, combos, (open + 1), close, path);/* Time O(2^N) | Space O(2^N) */
     path.pop();
 }
 
 const backTrackClose = (n, combos, open, close, path) => {
-    path.push(')');                             /*             | Space O(N) */
+    path.push(')');/* Space O(N) */
         dfs(n, combos, open, (close + 1), path);/* Time O(2^N) | Space O(2^N) */
     path.pop();
 }
 
 /**
- * https://leetcode.com/problems/generate-parentheses
+ * BFS
  * Time O(((4^N) / (N * SQRT(N)))) | Space O(((4^N) / (N * SQRT(N))))
  * Time O(2^N) | Space O(2^N)
+ * https://leetcode.com/problems/generate-parentheses
  * @param {number} n
  * @return {string[]}
  */
-var generateParenthesis = (n) => bfs(n);/* Time O(2^N) | Space O(2^N) */
+var generateParenthesis = (n) => bfs(n);
 
-const bfs = (n, queue, combos = []) => {
+const bfs = (n, combos = []) => {
     const queue = new Queue([ ['', 0, 0] ]);
 
     while (!queue.isEmpty()) {/* Time O(2^N) */
         const [ str, open, close ] = queue.dequeue();
-
-        const isBaseCase = (open === n) && (close === n);
+        
+        const isBaseCase = ((open === n) && (close === n));
         if (isBaseCase) {
-            combos.push(str);                                          /* Space O(N) */
+            combos.push(str);                                       /* Space O(N) */
 
             continue;
         }
@@ -69,31 +71,28 @@ const bfs = (n, queue, combos = []) => {
 }
 
 /**
- * https://leetcode.com/problems/generate-parentheses
+ * DFS
  * Time O(((4^N) / (N * SQRT(N)))) | Space O(((4^N) / (N * SQRT(N))))
  * Time O(2^N) | Space O(2^N)
+ * https://leetcode.com/problems/generate-parentheses
  * @param {number} n
  * @return {string[]}
  */
 var generateParenthesis = (n, combos = []) => {
-    const isBaseCase = n === 0;
+    const isBaseCase = (n === 0);
     if (isBaseCase) {
-        combos.push('');            /*             | Space O(N) */
+        combos.push('');
 
-        return combos;
+        return combos
     }
 
-    return closureNumber(n, combos);/* Time O(2^N) | Space O(2^N) */
-}
-
-const closureNumber = (n, combos) => {
-    for (let c = 0; c < n; c++) {/* Time O(N) */
-        for (const left of generateParenthesis(c)) {                 /* Time O(2^N) | Space O(2^N) */
-            for (const right of generateParenthesis(((n - 1) - c))) {/* Time O(2^N) | Space O(2^N) */
-                combos.push(`(${left})${right}`);                    /*             | Space O(N) */
+    for (let c = 0; (c < n); c++) {
+        for (const left of generateParenthesis(c)) {
+            for (const right of generateParenthesis(((n - 1) - c))) {
+                combos.push(`(${left})${right}`);
             }
         }
     }
 
     return combos
-}
+}