rustgym/leetcode/
_1162_as_far_from_land_as_possible.rs

1struct Solution;
2use std::collections::VecDeque;
3
4impl Solution {
5    fn max_distance(mut grid: Vec<Vec<i32>>) -> i32 {
6        let n = grid.len();
7        let m = grid[0].len();
8        let mut queue: VecDeque<(usize, usize, i32)> = VecDeque::new();
9        for i in 0..n {
10            for j in 0..m {
11                if grid[i][j] == 1 {
12                    queue.push_back((i, j, 0));
13                }
14            }
15        }
16        let mut res = -1;
17        let offsets = [(1, 0), (0, 1), (-1, 0), (0, -1)];
18        while let Some((i, j, d)) = queue.pop_front() {
19            for offset in &offsets {
20                let i = i as i32 + offset.0;
21                let j = j as i32 + offset.1;
22                if i >= 0 && j >= 0 && i < n as i32 && j < m as i32 {
23                    let i = i as usize;
24                    let j = j as usize;
25                    if grid[i][j] == 0 {
26                        grid[i][j] = 1;
27                        res = res.max(d + 1);
28                        queue.push_back((i, j, d + 1));
29                    }
30                }
31            }
32        }
33        res as i32
34    }
35}
36
37#[test]
38fn test() {
39    let grid = vec_vec_i32![[1, 0, 1], [0, 0, 0], [1, 0, 1]];
40    let res = 2;
41    assert_eq!(Solution::max_distance(grid), res);
42    let grid = vec_vec_i32![[1, 0, 0], [0, 0, 0], [0, 0, 0]];
43    let res = 4;
44    assert_eq!(Solution::max_distance(grid), res);
45}
rustgym/leetcode/_1162_as_far_from_land_as_possible.rs

rustgym/leetcode/
_1162_as_far_from_land_as_possible.rs
