solution for Flood fill question using DFS approach :
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. return the modified image.
Example :
Input:
image = [[1,1,1],[1,1,0],[1,0,1]]
sr = 1, sc = 1, newColor = 3
Output: [[3,3,3],[3,3,0],[3,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 3, because it is not 4-directionally connected
to the starting pixel.
class Solution {
public:
vector<vector<int>> floodFill(vector<vector<int>>& image, int sr, int sc, int newColor) {
int row = image.size();
int col = image[0].size();
if (sr < 0 || sr >= row || sc < 0 || sc >=col )
return image;
int m = image[sr][sc];
fillcolor(image, sr , sc , row,col, m, newColor);
return image;
}
void fillcolor(vector<vector<int>>& image, int r, int c , int row, int col, int m, int newColor) {
if (r < 0 || r >= row || c < 0 || c >= col || (image[r][c] != m) || (image[r][c] == newColor))
return;
image[r][c] = newColor;
fillcolor(image, r+1, c, row, col, m, newColor);
fillcolor(image, r-1, c, row, col, m,newColor);
fillcolor(image, r, c+1, row, col, m,newColor);
fillcolor(image, r, c-1, row, col, m,newColor);
}
};
