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

No.0778.Swim in Rising Water

Author: zhaocchen

solution/0700-0799/0778.Swim in Rising Water/README.md

@@ -206,6 +206,33 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function swimInWater(grid: number[][]): number {
+    const m = grid.length, n = grid[0].length;
+    let visited = Array.from({ length: m }, () => new Array(n).fill(false));
+    let ans = 0;
+    let stack = [[0, 0, grid[0][0]]];
+    const dir = [[0, 1], [0, -1], [1, 0], [-1, 0]];
+
+    while (stack.length) {
+        let [i, j] = stack.shift();
+        ans = Math.max(grid[i][j], ans);
+        if (i == m - 1 && j == n - 1) break;
+        for (let [dx, dy] of dir) {
+            let x = i + dx, y = j + dy;
+            if (x < m && x > -1 && y < n && y > -1 && !visited[x][y]) {
+                visited[x][y] = true;
+                stack.push([x, y, grid[x][y]]);
+            }
+        }
+        stack.sort((a, b) => a[2] - b[2]);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0700-0799/0778.Swim in Rising Water/README_EN.md

@@ -157,6 +157,33 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function swimInWater(grid: number[][]): number {
+    const m = grid.length, n = grid[0].length;
+    let visited = Array.from({ length: m }, () => new Array(n).fill(false));
+    let ans = 0;
+    let stack = [[0, 0, grid[0][0]]];
+    const dir = [[0, 1], [0, -1], [1, 0], [-1, 0]];
+
+    while (stack.length) {
+        let [i, j] = stack.shift();
+        ans = Math.max(grid[i][j], ans);
+        if (i == m - 1 && j == n - 1) break;
+        for (let [dx, dy] of dir) {
+            let x = i + dx, y = j + dy;
+            if (x < m && x > -1 && y < n && y > -1 && !visited[x][y]) {
+                visited[x][y] = true;
+                stack.push([x, y, grid[x][y]]);
+            }
+        }
+        stack.sort((a, b) => a[2] - b[2]);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0700-0799/0778.Swim in Rising Water/Solution.ts

@@ -0,0 +1,22 @@
+function swimInWater(grid: number[][]): number {
+    const m = grid.length, n = grid[0].length;
+    let visited = Array.from({ length: m }, () => new Array(n).fill(false));
+    let ans = 0;
+    let stack = [[0, 0, grid[0][0]]];
+    const dir = [[0, 1], [0, -1], [1, 0], [-1, 0]];
+
+    while (stack.length) {
+        let [i, j] = stack.shift();
+        ans = Math.max(grid[i][j], ans);
+        if (i == m - 1 && j == n - 1) break;
+        for (let [dx, dy] of dir) {
+            let x = i + dx, y = j + dy;
+            if (x < m && x > -1 && y < n && y > -1 && !visited[x][y]) {
+                visited[x][y] = true;
+                stack.push([x, y, grid[x][y]]);
+            }
+        }
+        stack.sort((a, b) => a[2] - b[2]);
+    }
+    return ans;
+};