feat: add typescript solution to lc problem: No.0695.Max Area of Island (doocs#460)

Author: zhaocchen

solution/0600-0699/0695.Max Area of Island/README.md

@@ -61,6 +61,40 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function maxAreaOfIsland(grid: number[][]): number {
+    let m = grid.length, n = grid[0].length;
+    let visited = Array.from({ length: m }, v => new Array(n).fill(false));
+    let res = 0;
+    for (let i = 0; i < m; ++i) {
+        for (let j = 0; j < n; ++j) {
+            if (!visited[i][j]) {
+                res = Math.max(dfs(grid, i, j, visited), res);
+            }
+        }
+    }
+    return res;
+};
+
+function dfs(grid: number[][], i: number, j: number, visited: boolean[][]): number {
+    let m = grid.length, n = grid[0].length;
+    if (i < 0 || i > m - 1 || j < 0 || j > n - 1 || visited[i][j]) {
+        return 0;
+    }
+    visited[i][j] = true;
+    if (grid[i][j] == 0) {
+        return 0;
+    }
+    let res = 1;
+    for (let [dx, dy] of [[0, 1], [0, -1], [1, 0], [-1, 0]]) {
+        res += dfs(grid, i + dx, j + dy, visited);
+    }
+    return res;
+}
+```
+
 ### **...**
 
 ```

solution/0600-0699/0695.Max Area of Island/README_EN.md

@@ -72,6 +72,40 @@ Given the above grid, return <code>0</code>.
 
 ```
 
+### **TypeScript**
+
+```ts
+function maxAreaOfIsland(grid: number[][]): number {
+    let m = grid.length, n = grid[0].length;
+    let visited = Array.from({ length: m }, v => new Array(n).fill(false));
+    let res = 0;
+    for (let i = 0; i < m; ++i) {
+        for (let j = 0; j < n; ++j) {
+            if (!visited[i][j]) {
+                res = Math.max(dfs(grid, i, j, visited), res);
+            }
+        }
+    }
+    return res;
+};
+
+function dfs(grid: number[][], i: number, j: number, visited: boolean[][]): number {
+    let m = grid.length, n = grid[0].length;
+    if (i < 0 || i > m - 1 || j < 0 || j > n - 1 || visited[i][j]) {
+        return 0;
+    }
+    visited[i][j] = true;
+    if (grid[i][j] == 0) {
+        return 0;
+    }
+    let res = 1;
+    for (let [dx, dy] of [[0, 1], [0, -1], [1, 0], [-1, 0]]) {
+        res += dfs(grid, i + dx, j + dy, visited);
+    }
+    return res;
+}
+```
+
 ### **...**
 
 ```

solution/0600-0699/0695.Max Area of Island/Solution.ts

@@ -0,0 +1,29 @@
+function maxAreaOfIsland(grid: number[][]): number {
+    let m = grid.length, n = grid[0].length;
+    let visited = Array.from({ length: m }, v => new Array(n).fill(false));
+    let res = 0;
+    for (let i = 0; i < m; ++i) {
+        for (let j = 0; j < n; ++j) {
+            if (!visited[i][j]) {
+                res = Math.max(dfs(grid, i, j, visited), res);
+            }
+        }
+    }
+    return res;
+};
+
+function dfs(grid: number[][], i: number, j: number, visited: boolean[][]): number {
+    let m = grid.length, n = grid[0].length;
+    if (i < 0 || i > m - 1 || j < 0 || j > n - 1 || visited[i][j]) {
+        return 0;
+    }
+    visited[i][j] = true;
+    if (grid[i][j] == 0) {
+        return 0;
+    }
+    let res = 1;
+    for (let [dx, dy] of [[0, 1], [0, -1], [1, 0], [-1, 0]]) {
+        res += dfs(grid, i + dx, j + dy, visited);
+    }
+    return res;
+}