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

Author: rain84

solution/1500-1599/1568.Minimum Number of Days to Disconnect Island/README.md

@@ -295,6 +295,64 @@ func minDays(grid [][]int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function minDays(grid: number[][]): number {
+    const [m, n] = [grid.length, grid[0].length];
+
+    const dfs = (i: number, j: number) => {
+        if (i < 0 || m <= i || j < 0 || n <= j || [0, 2].includes(grid[i][j])) return;
+
+        grid[i][j] = 2;
+        const dir = [-1, 0, 1, 0, -1];
+        for (let k = 0; k < 4; k++) {
+            const [y, x] = [i + dir[k], j + dir[k + 1]];
+            dfs(y, x);
+        }
+    };
+
+    const count = () => {
+        let c = 0;
+
+        for (let i = 0; i < m; i++) {
+            for (let j = 0; j < n; j++) {
+                if (grid[i][j] === 1) {
+                    dfs(i, j);
+                    c++;
+                }
+            }
+        }
+
+        for (let i = 0; i < m; i++) {
+            for (let j = 0; j < n; j++) {
+                if (grid[i][j] === 2) {
+                    grid[i][j] = 1;
+                }
+            }
+        }
+
+        return c;
+    };
+
+    if (count() !== 1) return 0;
+
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++) {
+            if (grid[i][j] === 1) {
+                grid[i][j] = 0;
+
+                if (count() !== 1) return 1;
+
+                grid[i][j] = 1;
+            }
+        }
+    }
+
+    return 2;
+}
+```
+
 #### JavaScript
 
 ```js

solution/1500-1599/1568.Minimum Number of Days to Disconnect Island/README_EN.md

@@ -286,6 +286,64 @@ func minDays(grid [][]int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function minDays(grid: number[][]): number {
+    const [m, n] = [grid.length, grid[0].length];
+
+    const dfs = (i: number, j: number) => {
+        if (i < 0 || m <= i || j < 0 || n <= j || [0, 2].includes(grid[i][j])) return;
+
+        grid[i][j] = 2;
+        const dir = [-1, 0, 1, 0, -1];
+        for (let k = 0; k < 4; k++) {
+            const [y, x] = [i + dir[k], j + dir[k + 1]];
+            dfs(y, x);
+        }
+    };
+
+    const count = () => {
+        let c = 0;
+
+        for (let i = 0; i < m; i++) {
+            for (let j = 0; j < n; j++) {
+                if (grid[i][j] === 1) {
+                    dfs(i, j);
+                    c++;
+                }
+            }
+        }
+
+        for (let i = 0; i < m; i++) {
+            for (let j = 0; j < n; j++) {
+                if (grid[i][j] === 2) {
+                    grid[i][j] = 1;
+                }
+            }
+        }
+
+        return c;
+    };
+
+    if (count() !== 1) return 0;
+
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++) {
+            if (grid[i][j] === 1) {
+                grid[i][j] = 0;
+
+                if (count() !== 1) return 1;
+
+                grid[i][j] = 1;
+            }
+        }
+    }
+
+    return 2;
+}
+```
+
 #### JavaScript
 
 ```js

solution/1500-1599/1568.Minimum Number of Days to Disconnect Island/Solution.ts

@@ -0,0 +1,53 @@
+function minDays(grid: number[][]): number {
+    const [m, n] = [grid.length, grid[0].length];
+
+    const dfs = (i: number, j: number) => {
+        if (i < 0 || m <= i || j < 0 || n <= j || [0, 2].includes(grid[i][j])) return;
+
+        grid[i][j] = 2;
+        const dir = [-1, 0, 1, 0, -1];
+        for (let k = 0; k < 4; k++) {
+            const [y, x] = [i + dir[k], j + dir[k + 1]];
+            dfs(y, x);
+        }
+    };
+
+    const count = () => {
+        let c = 0;
+
+        for (let i = 0; i < m; i++) {
+            for (let j = 0; j < n; j++) {
+                if (grid[i][j] === 1) {
+                    dfs(i, j);
+                    c++;
+                }
+            }
+        }
+
+        for (let i = 0; i < m; i++) {
+            for (let j = 0; j < n; j++) {
+                if (grid[i][j] === 2) {
+                    grid[i][j] = 1;
+                }
+            }
+        }
+
+        return c;
+    };
+
+    if (count() !== 1) return 0;
+
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++) {
+            if (grid[i][j] === 1) {
+                grid[i][j] = 0;
+
+                if (count() !== 1) return 1;
+
+                grid[i][j] = 1;
+            }
+        }
+    }
+
+    return 2;
+}