feat: add js/ts solutions to lc problem: No.0022 (doocs#3242)

Author: rain84

solution/0000-0099/0022.Generate Parentheses/README.md

@@ -256,6 +256,46 @@ class Solution {
 
 <!-- tabs:end -->
 
+<!-- solution:start -->
+
+### 方法二：递归
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function generateParenthesis(n: number): string[] {
+    if (n === 1) return ['()'];
+
+    return [
+        ...new Set(
+            generateParenthesis(n - 1).flatMap(s =>
+                Array.from(s, (_, i) => s.slice(0, i) + '()' + s.slice(i)),
+            ),
+        ),
+    ];
+}
+```
+
+#### JavaScript
+
+```js
+function generateParenthesis(n) {
+    if (n === 1) return ['()'];
+
+    return [
+        ...new Set(
+            generateParenthesis(n - 1).flatMap(s =>
+                Array.from(s, (_, i) => s.slice(0, i) + '()' + s.slice(i)),
+            ),
+        ),
+    ];
+}
+```
+
+<!-- tabs:end -->
+
 <!-- solution:end -->
 
 <!-- problem:end -->

solution/0000-0099/0022.Generate Parentheses/README_EN.md

@@ -148,25 +148,21 @@ func generateParenthesis(n int) (ans []string) {
 #### TypeScript
 
 ```ts
-impl Solution {
-    pub fn generate_parenthesis(n: i32) -> Vec<String> {
-        let mut ans = Vec::new();
-
-        fn dfs(ans: &mut Vec<String>, l: i32, r: i32, t: String, n: i32) {
-            if l > n || r > n || l < r {
-                return;
-            }
-            if l == n && r == n {
-                ans.push(t);
-                return;
-            }
-            dfs(ans, l + 1, r, format!("{}(", t), n);
-            dfs(ans, l, r + 1, format!("{})", t), n);
+function generateParenthesis(n: number): string[] {
+    function dfs(l, r, t) {
+        if (l > n || r > n || l < r) {
+            return;
         }
-
-        dfs(&mut ans, 0, 0, String::new(), n);
-        ans
+        if (l == n && r == n) {
+            ans.push(t);
+            return;
+        }
+        dfs(l + 1, r, t + '(');
+        dfs(l, r + 1, t + ')');
     }
+    let ans = [];
+    dfs(0, 0, '');
+    return ans;
 }
 ```
 
@@ -257,4 +253,46 @@ class Solution {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Recursion
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function generateParenthesis(n: number): string[] {
+    if (n === 1) return ['()'];
+
+    return [
+        ...new Set(
+            generateParenthesis(n - 1).flatMap(s =>
+                Array.from(s, (_, i) => s.slice(0, i) + '()' + s.slice(i)),
+            ),
+        ),
+    ];
+}
+```
+
+#### JavaScript
+
+```js
+function generateParenthesis(n) {
+    if (n === 1) return ['()'];
+
+    return [
+        ...new Set(
+            generateParenthesis(n - 1).flatMap(s =>
+                Array.from(s, (_, i) => s.slice(0, i) + '()' + s.slice(i)),
+            ),
+        ),
+    ];
+}
+```
+
+<!-- tabs:end -->
+
+<!-- solution:end -->
+
 <!-- problem:end -->

solution/0000-0099/0022.Generate Parentheses/Solution2.js

@@ -0,0 +1,11 @@
+function generateParenthesis(n) {
+    if (n === 1) return ['()'];
+
+    return [
+        ...new Set(
+            generateParenthesis(n - 1).flatMap(s =>
+                Array.from(s, (_, i) => s.slice(0, i) + '()' + s.slice(i)),
+            ),
+        ),
+    ];
+}

solution/0000-0099/0022.Generate Parentheses/Solution2.ts

@@ -0,0 +1,11 @@
+function generateParenthesis(n: number): string[] {
+    if (n === 1) return ['()'];
+
+    return [
+        ...new Set(
+            generateParenthesis(n - 1).flatMap(s =>
+                Array.from(s, (_, i) => s.slice(0, i) + '()' + s.slice(i)),
+            ),
+        ),
+    ];
+}