feat: add js solution to lcci problem: No.08.09.Bracket (doocs#377)

* feat: add javascript solution to lcci problem: No.08.09.Bracket
* fix: fix solution to lcci problem: No.08.09.Bracket
* chore: add open browser of script

Author: zhaocchen

lcci/08.09.Bracket/README.md

@@ -25,19 +25,19 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-<!-- tabs:start -->
-
-### **Python3**
-
-<!-- 这里可写当前语言的特殊实现逻辑 -->
-
 递归求解。其中，`left` 表示剩余的 `(`，`right` 表示剩余的 `)`。
 
 - 当 `left` > `right` 时，说明 state 中 `(` 少于 `)`，不是合法组合，直接剪枝；
 - 当 `right` == 0 时，说明 state 组合完毕；
 - 当 `left` > 0 时，此时可往 state 添加一个 `(`；
 - 当 `right` > 0 时，此时可往 state 添加一个 `)`。
 
+<!-- tabs:start -->
+
+### **Python3**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
 ```python
 class Solution:
     def generateParenthesis(self, n: int) -> List[str]:
@@ -89,6 +89,33 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number} n
+ * @return {string[]}
+ */
+ var generateParenthesis = function(n) {
+    let res = [];
+    dfs(n, 0, 0, '', res);
+    return res;
+};
+
+function dfs(n, left, right, prev, res) {
+    if (left == n && right == n) {
+        res.push(prev);
+        return;
+    }
+    if (left < n) {
+        dfs(n, left + 1, right, prev + '(', res);
+    }
+    if (right < left) {
+        dfs(n, left, right + 1, prev + ')', res);
+    }
+}
+```
+
 ### **...**
 
 ```

lcci/08.09.Bracket/README_EN.md

@@ -82,6 +82,33 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number} n
+ * @return {string[]}
+ */
+ var generateParenthesis = function(n) {
+    let res = [];
+    dfs(n, 0, 0, '', res);
+    return res;
+};
+
+function dfs(n, left, right, prev, res) {
+    if (left == n && right == n) {
+        res.push(prev);
+        return;
+    }
+    if (left < n) {
+        dfs(n, left + 1, right, prev + '(', res);
+    }
+    if (right < left) {
+        dfs(n, left, right + 1, prev + ')', res);
+    }
+}
+```
+
 ### **...**
 
 ```

lcci/08.09.Bracket/Solution.js

@@ -0,0 +1,22 @@
+/**
+ * @param {number} n
+ * @return {string[]}
+ */
+ var generateParenthesis = function(n) {
+    let res = [];
+    dfs(n, 0, 0, '', res);
+    return res;
+};
+
+function dfs(n, left, right, prev, res) {
+    if (left == n && right == n) {
+        res.push(prev);
+        return;
+    }
+    if (left < n) {
+        dfs(n, left + 1, right, prev + '(', res);
+    }
+    if (right < left) {
+        dfs(n, left, right + 1, prev + ')', res);
+    }
+}

package.json

@@ -1,6 +1,6 @@
 {
   "scripts": {
-    "dev": "docsify serve"
+    "dev": "docsify serve --open"
   },
   "dependencies": {
     "docsify-cli": "^4.4.3"