feat: add typescript solution to lc problem: No.0838

No.0838.Push Dominoes

Author: zhaocchen

solution/0800-0899/0838.Push Dominoes/README.md

@@ -133,6 +133,50 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function pushDominoes(dominoes: string): string {
+    const n = dominoes.length;
+    const map = {
+        L: -1,
+        R: 1,
+        '.': 0,
+    }
+    let ans = new Array(n).fill(0);
+    let visited = new Array(n).fill(0);
+    let queue = [];
+    let depth = 1;
+    for (let i = 0; i < n; i++) {
+        let cur = map[dominoes.charAt(i)];
+        if (cur) {
+            queue.push(i);
+            visited[i] = depth;
+            ans[i] = cur;
+        }
+    }
+    while (queue.length) {
+        depth++;
+        let nextLevel = [];
+        for (let i of queue) {
+            const dx = ans[i];
+            let x = i + dx;
+            if (x >= 0 && x < n && [0, depth].includes(visited[x])) {
+                ans[x] += dx;
+                visited[x] = depth;
+                nextLevel.push(x);
+            }
+        }
+        queue = nextLevel;
+    }
+    return ans.map(d => {
+        if (!d) return '.';
+        else if (d < 0) return 'L';
+        else return 'R';
+    }).join('');
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0800-0899/0838.Push Dominoes/README_EN.md

@@ -132,6 +132,50 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function pushDominoes(dominoes: string): string {
+    const n = dominoes.length;
+    const map = {
+        L: -1,
+        R: 1,
+        '.': 0,
+    }
+    let ans = new Array(n).fill(0);
+    let visited = new Array(n).fill(0);
+    let queue = [];
+    let depth = 1;
+    for (let i = 0; i < n; i++) {
+        let cur = map[dominoes.charAt(i)];
+        if (cur) {
+            queue.push(i);
+            visited[i] = depth;
+            ans[i] = cur;
+        }
+    }
+    while (queue.length) {
+        depth++;
+        let nextLevel = [];
+        for (let i of queue) {
+            const dx = ans[i];
+            let x = i + dx;
+            if (x >= 0 && x < n && [0, depth].includes(visited[x])) {
+                ans[x] += dx;
+                visited[x] = depth;
+                nextLevel.push(x);
+            }
+        }
+        queue = nextLevel;
+    }
+    return ans.map(d => {
+        if (!d) return '.';
+        else if (d < 0) return 'L';
+        else return 'R';
+    }).join('');
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0800-0899/0838.Push Dominoes/Solution.ts

@@ -0,0 +1,39 @@
+function pushDominoes(dominoes: string): string {
+    const n = dominoes.length;
+    const map = {
+        L: -1,
+        R: 1,
+        '.': 0,
+    }
+    let ans = new Array(n).fill(0);
+    let visited = new Array(n).fill(0);
+    let queue = [];
+    let depth = 1;
+    for (let i = 0; i < n; i++) {
+        let cur = map[dominoes.charAt(i)];
+        if (cur) {
+            queue.push(i);
+            visited[i] = depth;
+            ans[i] = cur;
+        }
+    }
+    while (queue.length) {
+        depth++;
+        let nextLevel = [];
+        for (let i of queue) {
+            const dx = ans[i];
+            let x = i + dx;
+            if (x >= 0 && x < n && [0, depth].includes(visited[x])) {
+                ans[x] += dx;
+                visited[x] = depth;
+                nextLevel.push(x);
+            }
+        }
+        queue = nextLevel;
+    }
+    return ans.map(d => {
+        if (!d) return '.';
+        else if (d < 0) return 'L';
+        else return 'R';
+    }).join('');
+};