feat: add ts solution to lc problem: No.2147 (doocs#2028)

Author: iam-abhishek-yadav

solution/2100-2199/2147.Number of Ways to Divide a Long Corridor/README.md

@@ -218,7 +218,28 @@ func numberOfWays(corridor string) int {
 ### **TypeScript**
 
 ```ts
+function numberOfWays(corridor: string): number {
+    const M: number = 1e9 + 7;
+    const seatNumbers: number[] = [];
 
+    for (let i = 0; i < corridor.length; i++) {
+        if (corridor.charAt(i) === 'S') {
+            seatNumbers.push(i);
+        }
+    }
+
+    if (seatNumbers.length % 2 !== 0 || seatNumbers.length === 0) {
+        return 0;
+    }
+
+    let result: number = 1;
+
+    for (let i = 2; i < seatNumbers.length; i += 2) {
+        result = (result * (seatNumbers[i] - seatNumbers[i - 1])) % M;
+    }
+
+    return result;
+}
 ```
 
 ### **...**

solution/2100-2199/2147.Number of Ways to Divide a Long Corridor/README_EN.md

@@ -193,7 +193,28 @@ func numberOfWays(corridor string) int {
 ### **TypeScript**
 
 ```ts
+function numberOfWays(corridor: string): number {
+    const M: number = 1e9 + 7;
+    const seatNumbers: number[] = [];
 
+    for (let i = 0; i < corridor.length; i++) {
+        if (corridor.charAt(i) === 'S') {
+            seatNumbers.push(i);
+        }
+    }
+
+    if (seatNumbers.length % 2 !== 0 || seatNumbers.length === 0) {
+        return 0;
+    }
+
+    let result: number = 1;
+
+    for (let i = 2; i < seatNumbers.length; i += 2) {
+        result = (result * (seatNumbers[i] - seatNumbers[i - 1])) % M;
+    }
+
+    return result;
+}
 ```
 
 ### **...**

solution/2100-2199/2147.Number of Ways to Divide a Long Corridor/solution.ts

@@ -0,0 +1,22 @@
+function numberOfWays(corridor: string): number {
+    const M: number = 1e9 + 7;
+    const seatNumbers: number[] = [];
+
+    for (let i = 0; i < corridor.length; i++) {
+        if (corridor.charAt(i) === 'S') {
+            seatNumbers.push(i);
+        }
+    }
+
+    if (seatNumbers.length % 2 !== 0 || seatNumbers.length === 0) {
+        return 0;
+    }
+
+    let result: number = 1;
+
+    for (let i = 2; i < seatNumbers.length; i += 2) {
+        result = (result * (seatNumbers[i] - seatNumbers[i - 1])) % M;
+    }
+
+    return result;
+}