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
andimage[0]
will be in the range[1, 50]
. - The given starting pixel will satisfy
0 <= sr < image.length
and0 <= sc < image[0].length
. - The value of each color in
image[i][j]
andnewColor
will be an integer in[0, 65535]
.
class Solution {
private static final List<int[]> DIRECTION = Arrays.asList(
new int[]{1,0},new int[]{-1,0},new int[]{0,1},new int[]{0,-1});
public int[][] floodFill(int[][] image, int sr, int sc, int newColor) {
if (image == null || image.length == 0) return image;
int rowNum = image.length;
int colNum = image[0].length;
int curValue = image[sr][sc];
if (curValue == newColor)
return image;
Queue<int[]> queue = new LinkedList();
queue.offer(new int[]{sr, sc});
while (!queue.isEmpty()) {
int[] point = queue.poll();
int row = point[0];
int col = point[1];
image[row][col] = newColor;
for (int[] direction : DIRECTION) {
int r = row + direction[0];
int c = col + direction[1];
if (r < 0 || r > rowNum-1 || c < 0 || c > colNum-1 || image[r][c] != curValue)
continue;
image[r][c] = newColor;
queue.offer(new int[]{r, c});
}
}
return image;
}
}
DFS
class Solution {
public int[][] floodFill(int[][] image, int sr, int sc, int newColor) {
if (image == null || image.length == 0) return image;
int oldColor = image[sr][sc];
if (oldColor == newColor) return image;
DFS(image, sr, sc, newColor, oldColor);
return image;
}
private void DFS(int[][]image, int sr, int sc, int newColor, int oldColor) {
int rowNum = image.length;
int colNum = image[0].length;
if (sr < 0 || sr > rowNum-1 || sc < 0 || sc > colNum-1 || image[sr][sc] != oldColor)
return;
image[sr][sc] = newColor;
DFS(image, sr+1, sc, newColor, oldColor);
DFS(image, sr-1, sc, newColor, oldColor);
DFS(image, sr, sc+1, newColor, oldColor);
DFS(image, sr, sc-1, newColor, oldColor);
}
}