733. Flood Fill

An `image` is represented by a 2-D array of integers, each integer representing the pixel value of the image (from 0 to 65535).

Given a coordinate `(sr, sc)` representing the starting pixel (row and column) of the flood fill, and a pixel value `newColor`, "flood fill" the image.

To perform a "flood fill", consider the starting pixel, plus any pixels connected 4-directionally to the starting pixel of the same color as the starting pixel, plus any pixels connected 4-directionally to those pixels (also with the same color as the starting pixel), and so on. Replace the color of all of the aforementioned pixels with the newColor.

At the end, return the modified image.

Example 1:

```Input:
image = [[1,1,1],[1,1,0],[1,0,1]]
sr = 1, sc = 1, newColor = 2
Output: [[2,2,2],[2,2,0],[2,0,1]]
Explanation:
From the center of the image (with position (sr, sc) = (1, 1)), all pixels connected
by a path of the same color as the starting pixel are colored with the new color.
Note the bottom corner is not colored 2, because it is not 4-directionally connected
to the starting pixel.
```

Note:

• The length of `image` and `image` will be in the range `[1, 50]`.
• The given starting pixel will satisfy `0 <= sr < image.length` and `0 <= sc < image.length`.
• The value of each color in `image[i][j]` and `newColor` will be an integer in `[0, 65535]`.
• 733. Flood Fill
``````struct Solution;

use std::collections::VecDeque;

struct Pixel {
i: usize,
j: usize,
}

impl Solution {
fn flood_fill(mut image: Vec<Vec<i32>>, sr: i32, sc: i32, new_color: i32) -> Vec<Vec<i32>> {
let n = image.len();
if n == 0 {
return image;
}
let m = image.len();
if m == 0 {
return image;
}
if sr < 0 {
return image;
}
let sr = sr as usize;
if sr >= n {
return image;
}
if sc < 0 {
return image;
}
let sc = sc as usize;
if sc >= m {
return image;
}
let c = image[sr][sc];
if c == new_color {
return image;
}
let mut queue: VecDeque<Pixel> = VecDeque::new();
queue.push_back(Pixel { i: sr, j: sc });
let di = vec![0, 0, -1, 1];
let dj = vec![-1, 1, 0, 0];
while let Some(pixel) = queue.pop_front() {
let i = pixel.i;
let j = pixel.j;
image[i][j] = new_color;
for k in 0..4 {
let i = i as i32 + di[k];
let j = j as i32 + dj[k];
if i < 0 {
continue;
}
let i = i as usize;
if i >= n {
continue;
}
if j < 0 {
continue;
}
let j = j as usize;
if j >= m {
continue;
}
if image[i][j] != c {
continue;
}
queue.push_back(Pixel { i, j })
}
}
image
}
}

#[test]
fn test() {
let image = vec![vec![1, 1, 1], vec![1, 1, 0], vec![1, 0, 1]];
let sr = 1;
let sc = 1;
let new_color = 2;
let new_image = vec![vec![2, 2, 2], vec![2, 2, 0], vec![2, 0, 1]];
assert_eq!(Solution::flood_fill(image, sr, sc, new_color), new_image);
}
``````