Leetcode May Challenge - 05/11: Flood Fill(Python)

题目描述

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.

例子

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

解释

这道题，简单来说就是一个二维的矩阵，给定一个起点的横纵坐标(sr, sc)和一个new color，从这个起点开始，把包含起点在内的所有联通的点都替换为new color。
联通的定义是：从起点开始，每一步可以往上下左右走，可以走到的且颜色相同的点都是和起点的联通点。

思路 深度优先搜索（DFS）

看了上面联通的定义，就很自然而然的会想到DFS。我们沿着一条路走到底，走不通退回分叉点换路继续走，知道走完所有通路即可。
这里要注意题目中没有说new color一定和之前的颜色不同，所以如果相同，我的处理是直接判断，如果相同，直接返回原图。

代码

class Solution(object):
    def floodFill(self, image, sr, sc, newColor):
        """
        :type image: List[List[int]]
        :type sr: int
        :type sc: int
        :type newColor: int
        :rtype: List[List[int]]
        """
        starting = image[sr][sc]
        if starting == newColor:
            return image
        self.dfs(image, sr, sc, newColor, starting)
        return image
        
    def dfs(self, image, sr, sc, newColor, starting):
        image[sr][sc] = newColor
        directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]
        for x, y in directions:
            if 0 <= sr + x < len(image) and 0 <= sc + y < len(image[0]) and image[sr + x][sc + y] == starting:
                self.dfs(image, sr + x, sc + y, newColor, starting)