feat: add ts solution to lc problem: No.1190

Author: rain84

solution/1100-1199/1190.Reverse Substrings Between Each Pair of Parentheses/README.md

@@ -214,6 +214,39 @@ var reverseParentheses = function (s) {
 };
 ```
 
+#### JavaScript
+
+```ts
+function reverseParentheses(s: string): string {
+    const n = s.length;
+    const d = new Array(n).fill(0);
+    const stk = [];
+    for (let i = 0; i < n; ++i) {
+        if (s[i] === '(') {
+            stk.push(i);
+        } else if (s[i] === ')') {
+            const j = stk.pop()!;
+            d[i] = j;
+            d[j] = i;
+        }
+    }
+    let i = 0;
+    let x = 1;
+    const ans = [];
+    while (i < n) {
+        const c = s.charAt(i);
+        if (c === '(' || c === ')') {
+            i = d[i];
+            x = -x;
+        } else {
+            ans.push(c);
+        }
+        i += x;
+    }
+    return ans.join('');
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1100-1199/1190.Reverse Substrings Between Each Pair of Parentheses/README_EN.md

@@ -207,6 +207,39 @@ var reverseParentheses = function (s) {
 };
 ```
 
+#### JavaScript
+
+```ts
+function reverseParentheses(s: string): string {
+    const n = s.length;
+    const d = new Array(n).fill(0);
+    const stk = [];
+    for (let i = 0; i < n; ++i) {
+        if (s[i] === '(') {
+            stk.push(i);
+        } else if (s[i] === ')') {
+            const j = stk.pop()!;
+            d[i] = j;
+            d[j] = i;
+        }
+    }
+    let i = 0;
+    let x = 1;
+    const ans = [];
+    while (i < n) {
+        const c = s.charAt(i);
+        if (c === '(' || c === ')') {
+            i = d[i];
+            x = -x;
+        } else {
+            ans.push(c);
+        }
+        i += x;
+    }
+    return ans.join('');
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1100-1199/1190.Reverse Substrings Between Each Pair of Parentheses/Solution.ts

@@ -0,0 +1,28 @@
+function reverseParentheses(s: string): string {
+    const n = s.length;
+    const d = new Array(n).fill(0);
+    const stk = [];
+    for (let i = 0; i < n; ++i) {
+        if (s[i] === '(') {
+            stk.push(i);
+        } else if (s[i] === ')') {
+            const j = stk.pop()!;
+            d[i] = j;
+            d[j] = i;
+        }
+    }
+    let i = 0;
+    let x = 1;
+    const ans = [];
+    while (i < n) {
+        const c = s.charAt(i);
+        if (c === '(' || c === ')') {
+            i = d[i];
+            x = -x;
+        } else {
+            ans.push(c);
+        }
+        i += x;
+    }
+    return ans.join('');
+}