👨‍💻 738LeetCode

Flood Fill

Question

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.

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.

Solution

class Solution:
    def floodFill(self, image: List[List[int]], sr: int, sc: int, new_color: int) -> List[List[int]]:
        def is_in_border(i, j):
            if i < 0 or j < 0 or i >= len(image) or j >= len(image[0]):
                return False
            return True


        def helper(i, j, old_color, visited):
            if is_in_border(i, j) and not visited[i][j] and image[i][j] == old_color:
                image[i][j] = new_color
                visited[i][j] = 1
            if is_in_border(i - 1, j) and not visited[i - 1][j] and image[i - 1][j] == old_color:
                image[i - 1][j] = new_color
                visited[i - 1][j] = 1
                helper(i - 1, j, old_color, visited)
            if is_in_border(i, j - 1) and not visited[i][j - 1] and image[i][j - 1] == old_color:
                image[i][j - 1] = new_color
                visited[i][j - 1] = 1
                helper(i, j - 1, old_color, visited)
            if is_in_border(i + 1, j) and not visited[i + 1][j] and image[i + 1][j] == old_color:
                image[i + 1][j] = new_color
                visited[i + 1][j] = 1
                helper(i + 1, j, old_color, visited)
            if is_in_border(i, j + 1) and not visited[i][j + 1] and image[i][j + 1] == old_color:
                image[i][j + 1] = new_color
                visited[i][j + 1] = 1
                helper(i, j + 1, old_color, visited)


        visited = [[0] * len(image[0]) for _ in range(len(image))]
        helper(sr, sc, image[sr][sc], visited)
        return image