feat: add typescript solution to lc problem: No.0022.Generate Parentheses (doocs#489)

Author: zhaocchen

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

@@ -37,6 +37,8 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+dfs
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -87,6 +89,29 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function generateParenthesis(n: number): string[] {
+    let ans = [];
+    dfs(n, 0, 0, '', ans);
+    return ans;
+};
+
+function dfs(n: number, left: number, right: number, str: string, ans: string[]) {
+    if (str.length == 2 * n) {
+        ans.push(str);
+        return;
+    }
+    if (left < n) {
+        dfs(n, left + 1, right, str + '(', ans);
+    }
+    if (right < left) {
+        dfs(n, left, right + 1, str + ')', ans);
+    }
+}
+```
+
 ### **C++**
 
 ```cpp

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

@@ -70,6 +70,29 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function generateParenthesis(n: number): string[] {
+    let ans = [];
+    dfs(n, 0, 0, '', ans);
+    return ans;
+};
+
+function dfs(n: number, left: number, right: number, str: string, ans: string[]) {
+    if (str.length == 2 * n) {
+        ans.push(str);
+        return;
+    }
+    if (left < n) {
+        dfs(n, left + 1, right, str + '(', ans);
+    }
+    if (right < left) {
+        dfs(n, left, right + 1, str + ')', ans);
+    }
+}
+```
+
 ### **C++**
 
 ```cpp

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

@@ -0,0 +1,18 @@
+function generateParenthesis(n: number): string[] {
+    let ans = [];
+    dfs(n, 0, 0, '', ans);
+    return ans;
+};
+
+function dfs(n: number, left: number, right: number, str: string, ans: string[]) {
+    if (str.length == 2 * n) {
+        ans.push(str);
+        return;
+    }
+    if (left < n) {
+        dfs(n, left + 1, right, str + '(', ans);
+    }
+    if (right < left) {
+        dfs(n, left, right + 1, str + ')', ans);
+    }
+}