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

No.2290.Minimum Obstacle Removal to Reach Corner

Author: zhaocchen

solution/2200-2299/2290.Minimum Obstacle Removal to Reach Corner/README.md

@@ -212,7 +212,25 @@ func minimumObstacles(grid [][]int) int {
 ### **TypeScript**
 
 ```ts
-
+function minimumObstacles(grid: number[][]): number {
+    const m = grid.length, n = grid[0].length;
+    const dirs = [[0, 1], [0, -1], [1, 0], [-1, 0]];
+    let ans = Array.from({ length: m }, v => new Array(n).fill(Infinity));
+    ans[0][0] = 0;
+    let deque = [[0, 0]];
+    while (deque.length) {
+        let [x, y] = deque.shift();
+        for (let [dx, dy] of dirs) {
+            let [i, j] = [x + dx, y + dy];
+            if (i < 0 || i > m - 1 || j < 0 || j > n - 1) continue;
+            const cost = grid[i][j];
+            if (ans[x][y] + cost >= ans[i][j]) continue;
+            ans[i][j] = ans[x][y] + cost;
+            deque.push([i, j]);
+        }
+    }
+    return ans[m - 1][n - 1];
+};
 ```
 
 ### **...**

solution/2200-2299/2290.Minimum Obstacle Removal to Reach Corner/README_EN.md

@@ -186,7 +186,25 @@ func minimumObstacles(grid [][]int) int {
 ### **TypeScript**
 
 ```ts
-
+function minimumObstacles(grid: number[][]): number {
+    const m = grid.length, n = grid[0].length;
+    const dirs = [[0, 1], [0, -1], [1, 0], [-1, 0]];
+    let ans = Array.from({ length: m }, v => new Array(n).fill(Infinity));
+    ans[0][0] = 0;
+    let deque = [[0, 0]];
+    while (deque.length) {
+        let [x, y] = deque.shift();
+        for (let [dx, dy] of dirs) {
+            let [i, j] = [x + dx, y + dy];
+            if (i < 0 || i > m - 1 || j < 0 || j > n - 1) continue;
+            const cost = grid[i][j];
+            if (ans[x][y] + cost >= ans[i][j]) continue;
+            ans[i][j] = ans[x][y] + cost;
+            deque.push([i, j]);
+        }
+    }
+    return ans[m - 1][n - 1];
+};
 ```
 
 ### **...**

solution/2200-2299/2290.Minimum Obstacle Removal to Reach Corner/Solution.ts

@@ -0,0 +1,19 @@
+function minimumObstacles(grid: number[][]): number {
+    const m = grid.length, n = grid[0].length;
+    const dirs = [[0, 1], [0, -1], [1, 0], [-1, 0]];
+    let ans = Array.from({ length: m }, v => new Array(n).fill(Infinity));
+    ans[0][0] = 0;
+    let deque = [[0, 0]];
+    while (deque.length) {
+        let [x, y] = deque.shift();
+        for (let [dx, dy] of dirs) {
+            let [i, j] = [x + dx, y + dy];
+            if (i < 0 || i > m - 1 || j < 0 || j > n - 1) continue;
+            const cost = grid[i][j];
+            if (ans[x][y] + cost >= ans[i][j]) continue;
+            ans[i][j] = ans[x][y] + cost;
+            deque.push([i, j]);
+        }
+    }
+    return ans[m - 1][n - 1];
+};