feat: add rust solution to lc problem: No.0695

No.0695.Max Area of Island

Author: YangFong

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

@@ -507,6 +507,41 @@ func max(a, b int) int {
 }
 ```
 
+### **Rust**
+
+DFS：
+
+```rust
+impl Solution {
+    fn dfs(grid: &mut Vec<Vec<i32>>, i: usize, j: usize) -> i32 {
+        if i == grid.len() || j == grid[0].len() || grid[i][j] == 0 {
+            return 0;
+        }
+        grid[i][j] = 0;
+        let mut res = 1 + Self::dfs(grid, i + 1, j) + Self::dfs(grid, i, j + 1);
+        if i != 0 {
+            res += Self::dfs(grid, i - 1, j)
+        }
+        if j != 0 {
+            res += Self::dfs(grid, i, j - 1)
+        }
+        res
+    }
+
+    pub fn max_area_of_island(mut grid: Vec<Vec<i32>>) -> i32 {
+        let m = grid.len();
+        let n = grid[0].len();
+        let mut res = 0;
+        for i in 0..m {
+            for j in 0..n {
+                res = res.max(Self::dfs(&mut grid, i, j))
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

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

@@ -442,6 +442,41 @@ func max(a, b int) int {
 }
 ```
 
+### **Rust**
+
+DFS：
+
+```rust
+impl Solution {
+    fn dfs(grid: &mut Vec<Vec<i32>>, i: usize, j: usize) -> i32 {
+        if i == grid.len() || j == grid[0].len() || grid[i][j] == 0 {
+            return 0;
+        }
+        grid[i][j] = 0;
+        let mut res = 1 + Self::dfs(grid, i + 1, j) + Self::dfs(grid, i, j + 1);
+        if i != 0 {
+            res += Self::dfs(grid, i - 1, j)
+        }
+        if j != 0 {
+            res += Self::dfs(grid, i, j - 1)
+        }
+        res
+    }
+
+    pub fn max_area_of_island(mut grid: Vec<Vec<i32>>) -> i32 {
+        let m = grid.len();
+        let n = grid[0].len();
+        let mut res = 0;
+        for i in 0..m {
+            for j in 0..n {
+                res = res.max(Self::dfs(&mut grid, i, j))
+            }
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

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

@@ -0,0 +1,28 @@
+impl Solution {
+    fn dfs(grid: &mut Vec<Vec<i32>>, i: usize, j: usize) -> i32 {
+        if i == grid.len() || j == grid[0].len() || grid[i][j] == 0 {
+            return 0;
+        }
+        grid[i][j] = 0;
+        let mut res = 1 + Self::dfs(grid, i + 1, j) + Self::dfs(grid, i, j + 1);
+        if i != 0 {
+            res += Self::dfs(grid, i - 1, j)
+        }
+        if j != 0 {
+            res += Self::dfs(grid, i, j - 1)
+        }
+        res
+    }
+
+    pub fn max_area_of_island(mut grid: Vec<Vec<i32>>) -> i32 {
+        let m = grid.len();
+        let n = grid[0].len();
+        let mut res = 0;
+        for i in 0..m {
+            for j in 0..n {
+                res = res.max(Self::dfs(&mut grid, i, j))
+            }
+        }
+        res
+    }
+}