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 ofimage
and
image[0]
will be in the range
[1, 50]
.The given starting pixel will satisfy
0 <= sr < image.length
and
0 <= sc < image[0].length
.The value of each color in
image[i][j]
and
newColor
will be an integer in
[0, 65535]
.
bfs遍历图,注意一定要判断dx和dy是否在image范围内,要用vis记录当前node是否被访问,只有当前点的值和origin的值相等才放在queue里,代码如下:
class Solution {
public:
int x[4] = {0, 0, 1, -1};
int y[4] = {1, -1, 0, 0};
vector<vector<int>> floodFill(vector<vector<int>>& image, int sr, int sc, int newColor) {
int origin = image[sr][sc];
int n = image.size();
int m = image[0].size();
vector<vector<int>> vis (n, vector<int>(m, 0));
queue<pair<int, int>> q;
q.push({sr, sc});
while (!q.empty()) {
pair<int, int> node = q.front();
q.pop();
vis[node.first][node.second] = 1;
if (image[node.first][node.second] == origin) image[node.first][node.second] = newColor;
for (int i = 0; i < 4; i++) {
int dx = node.first + x[i];
int dy = node.second + y[i];
if (dx >=0 && dx < n && dy >=0 && dy < m && vis[dx][dy] == 0 && image[dx][dy] == origin)
q.push({dx, dy});
}
}
return image;
}
};