Leetcode 733. Flood Fill

小白菜又菜

已于 2022-07-27 22:39:36 修改

阅读量188

点赞数

分类专栏： Leetcode 解题报告入门题文章标签： leetcode 算法职场和发展

于 2022-07-27 22:38:50 首次发布

本文链接：https://blog.csdn.net/mobius_strip/article/details/126024691

版权

解题报告同时被 3 个专栏收录

1392 篇文章

订阅专栏

入门题

305 篇文章

订阅专栏

Leetcode

168 篇文章

订阅专栏

这篇博客介绍了一种使用深度优先搜索（DFS）算法解决图像填充问题的方法。给定一个网格图像和起始像素坐标，你需要将所有同色相邻像素替换为指定颜色，展示了如何通过递归实现 floodFill 函数来完成操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem

An image is represented by an m x n integer grid image where image[i][j] represents the pixel value of the image.

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].

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.

Return the modified image after performing the flood fill.

Algorithm

DFS. Note when starting pixel is same as the color.

Code

class Solution:
    def floodFill(self, image: List[List[int]], sr: int, sc: int, color: int) -> List[List[int]]:
        if image[sr][sc] == color:
            return image
        
        def floodfill(sr, sc, rr, cc, scolor, color):
            if sr < 0 or sr >= rr or sc < 0 or sc >= cc or image[sr][sc] != scolor:
                return
            image[sr][sc] = color
            floodfill(sr-1, sc, rr, cc, scolor, color)
            floodfill(sr+1, sc, rr, cc, scolor, color)
            floodfill(sr, sc-1, rr, cc, scolor, color)
            floodfill(sr, sc+1, rr, cc, scolor, color)       
        
        rr = len(image)
        cc = len(image[0])
        floodfill(sr, sc, rr, cc, image[sr][sc], color)
        return image