cauly_rust_leetcode_utils/
grid.rs1pub struct Grid<T>
3where
4 T: Clone,
5{
6 width: usize,
7 height: usize,
8 values: Vec<Vec<T>>,
9}
10
11pub struct GridItem<T>
12where
13 T: Clone,
14{
15 pub val: T,
16 pub x: usize,
17 pub y: usize,
18}
19
20impl<T> Grid<T>
21where
22 T: Default,
23 T: Clone,
24{
25 pub fn new(width: usize, height: usize) -> Self {
26 Grid {
27 width,
28 height,
29 values: vec![vec![T::default(); width]; height],
30 }
31 }
32}
33
34impl<T> Grid<T>
35where
36 T: Clone,
37{
38 pub fn from(grid: Vec<Vec<T>>) -> Self {
39 Grid {
40 width: grid[0].len(),
41 height: grid.len(),
42 values: grid,
43 }
44 }
45 pub fn get_near_4(&self, pos: (usize, usize)) -> Vec<GridItem<T>> {
46 let mut result = Vec::new();
47
48 if pos.0 > 0 {
49 result.push(GridItem {
50 x: pos.0 - 1,
51 y: pos.1,
52 val: self.values[pos.1][pos.0 - 1].clone(),
53 });
54 }
55 if pos.0 < self.width - 1 {
56 result.push(GridItem {
57 x: pos.0 + 1,
58 y: pos.1,
59 val: self.values[pos.1][pos.0 + 1].clone(),
60 });
61 }
62 if pos.1 > 0 {
63 result.push(GridItem {
64 x: pos.0,
65 y: pos.1 - 1,
66 val: self.values[pos.1 - 1][pos.0].clone(),
67 });
68 }
69 if pos.1 < self.height - 1 {
70 result.push(GridItem {
71 x: pos.0,
72 y: pos.1 + 1,
73 val: self.values[pos.1 + 1][pos.0].clone(),
74 });
75 }
76
77 result
78 }
79 pub fn is_near_4(&self, pos1: (usize, usize), pos2: (usize, usize)) -> bool {
80 let x = (pos1.0 as i32 - pos2.0 as i32).abs();
81 let y = (pos1.1 as i32 - pos2.1 as i32).abs();
82 x == 1 && y == 0 || x == 0 && y == 1
83 }
84}
85
86