# Leetcode-733. Flood Fill 图像渲染 （矩阵DFS）

### 题目

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.

Note:

• The length of image 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].

Example:

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.

### 思路及代码

#### DFS

• 记录原始颜色，在dfs中若碰到与原始颜色不同则return
class Solution:
def floodFill(self, image: List[List[int]], sr: int, sc: int, newColor: int) -> List[List[int]]:
def dfs(i, j, color):
if image[i][j] != color:
return
image[i][j] = newColor
if i != 0:
dfs(i-1, j, color)
if i != m-1:
dfs(i+1, j, color)
if j != 0:
dfs(i, j-1, color)
if j != n-1:
dfs(i, j+1, color)

if image[sr][sc] == newColor:
return image
m = len(image)
n = len(image[0])
dfs(sr, sc, image[sr][sc])
return image


### 复杂度

T = $O(mn)$
S = $O(mn)$

02-28 1510

04-08 1586

05-25 1699

08-06 4328

04-16 2855

04-16 5838

04-30 2899

05-14 3556

05-12 2738

04-17 4656

05-26 2281

05-24 1916

03-15 3438

07-03 2168

02-10 4020

02-08 2690

04-16 5102

02-14 1万+

04-17 19

12-20 7679

#### Leetcode算法Java全解答--74. 搜索二维矩阵

©️2019 CSDN 皮肤主题: 技术黑板 设计师: CSDN官方博客