|
| 1 | +# [733. Flood Fill](https://leetcode.com/problems/flood-fill) |
| 2 | + |
| 3 | +An image is represented by an m x n integer grid image where image[i][j] represents the pixel value of the image. |
| 4 | + |
| 5 | +You are also given three integers sr, sc, and color. You should perform a flood fill on the image starting from the pixel image[sr][sc]. |
| 6 | + |
| 7 | +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), and so on. Replace the color of all of the aforementioned pixels with color. |
| 8 | + |
| 9 | +Return the modified image after performing the flood fill. |
| 10 | + |
| 11 | + |
| 12 | + |
| 13 | +Example 1: |
| 14 | + |
| 15 | + |
| 16 | +Input: image = [[1,1,1],[1,1,0],[1,0,1]], sr = 1, sc = 1, color = 2 |
| 17 | +Output: [[2,2,2],[2,2,0],[2,0,1]] |
| 18 | +Explanation: From the center of the image with position (sr, sc) = (1, 1) (i.e., the red pixel), all pixels connected by a path of the same color as the starting pixel (i.e., the blue pixels) are colored with the new color. |
| 19 | +Note the bottom corner is not colored 2, because it is not 4-directionally connected to the starting pixel. |
| 20 | +Example 2: |
| 21 | + |
| 22 | +Input: image = [[0,0,0],[0,0,0]], sr = 0, sc = 0, color = 0 |
| 23 | +Output: [[0,0,0],[0,0,0]] |
| 24 | +Explanation: The starting pixel is already colored 0, so no changes are made to the image. |
| 25 | + |
| 26 | + |
| 27 | +Constraints: |
| 28 | + |
| 29 | +m == image.length |
| 30 | +n == image[i].length |
| 31 | +1 <= m, n <= 50 |
| 32 | +0 <= image[i][j], color < 216 |
| 33 | +0 <= sr < m |
| 34 | +0 <= sc < n |
0 commit comments