Merge pull request #2775 from Nomop/kamacoder-100-rust

Update 0100.岛屿的最大面积.md

problems/kamacoder/0100.岛屿的最大面积.md

@@ -503,6 +503,144 @@ func main() {
 
 
 ### Rust
+DFS
+
+``` rust
+use std::io;
+use std::cmp;
+
+// 定义四个方向
+const DIRECTIONS: [(i32, i32); 4] = [(0, 1), (1, 0), (-1, 0), (0, -1)];
+
+fn dfs(grid: &Vec<Vec<i32>>, visited: &mut Vec<Vec<bool>>, x: usize, y: usize, count: &mut i32) {
+    if visited[x][y] || grid[x][y] == 0 {
+        return; // 终止条件：已访问或者遇到海水
+    }
+    visited[x][y] = true; // 标记已访问
+    *count += 1;
+
+    for &(dx, dy) in DIRECTIONS.iter() {
+        let new_x = x as i32 + dx;
+        let new_y = y as i32 + dy;
+
+        // 检查边界条件
+        if new_x >= 0 && new_x < grid.len() as i32 && new_y >= 0 && new_y < grid[0].len() as i32 {
+            dfs(grid, visited, new_x as usize, new_y as usize, count);
+        }
+    }
+}
+
+fn main() {
+    let mut input = String::new();
+
+    // 读取 n 和 m
+    io::stdin().read_line(&mut input);
+    let dims: Vec<usize> = input.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
+    let (n, m) = (dims[0], dims[1]);
+
+    // 读取 grid
+    let mut grid = vec![];
+    for _ in 0..n {
+        input.clear();
+        io::stdin().read_line(&mut input);
+        let row: Vec<i32> = input.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
+        grid.push(row);
+    }
+
+    // 初始化访问记录
+    let mut visited = vec![vec![false; m]; n];
+    let mut result = 0;
+
+    // 遍历所有格子
+    for i in 0..n {
+        for j in 0..m {
+            if !visited[i][j] && grid[i][j] == 1 {
+                let mut count = 0;
+                dfs(&grid, &mut visited, i, j, &mut count);
+                result = cmp::max(result, count);
+            }
+        }
+    }
+
+    // 输出结果
+    println!("{}", result);
+}
+
+```
+BFS
+```rust
+use std::io;
+use std::collections::VecDeque;
+
+// 定义四个方向
+const DIRECTIONS: [(i32, i32); 4] = [(0, 1), (1, 0), (-1, 0), (0, -1)];
+
+fn bfs(grid: &Vec<Vec<i32>>, visited: &mut Vec<Vec<bool>>, x: usize, y: usize) -> i32 {
+    let mut count = 0;
+    let mut queue = VecDeque::new();
+    queue.push_back((x, y));
+    visited[x][y] = true; // 标记已访问
+
+    while let Some((cur_x, cur_y)) = queue.pop_front() {
+        count += 1; // 增加计数
+
+        for &(dx, dy) in DIRECTIONS.iter() {
+            let new_x = cur_x as i32 + dx;
+            let new_y = cur_y as i32 + dy;
+
+            // 检查边界条件
+            if new_x >= 0 && new_x < grid.len() as i32 && new_y >= 0 && new_y < grid[0].len() as i32 {
+                let new_x_usize = new_x as usize;
+                let new_y_usize = new_y as usize;
+
+                // 如果未访问且是陆地，加入队列
+                if !visited[new_x_usize][new_y_usize] && grid[new_x_usize][new_y_usize] == 1 {
+                    visited[new_x_usize][new_y_usize] = true; // 标记已访问
+                    queue.push_back((new_x_usize, new_y_usize));
+                }
+            }
+        }
+    }
+
+    count
+}
+
+fn main() {
+    let mut input = String::new();
+
+    // 读取 n 和 m
+    io::stdin().read_line(&mut input).expect("Failed to read line");
+    let dims: Vec<usize> = input.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
+    let (n, m) = (dims[0], dims[1]);
+
+    // 读取 grid
+    let mut grid = vec![];
+    for _ in 0..n {
+        input.clear();
+        io::stdin().read_line(&mut input).expect("Failed to read line");
+        let row: Vec<i32> = input.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
+        grid.push(row);
+    }
+
+    // 初始化访问记录
+    let mut visited = vec![vec![false; m]; n];
+    let mut result = 0;
+
+    // 遍历所有格子
+    for i in 0..n {
+        for j in 0..m {
+            if !visited[i][j] && grid[i][j] == 1 {
+                let count = bfs(&grid, &mut visited, i, j);
+                result = result.max(count);
+            }
+        }
+    }
+
+    // 输出结果
+    println!("{}", result);
+}
+
+```
 
 ### Javascript