mirror of https://github.com/doocs/leetcode.git
22 lines
606 B
Python
22 lines
606 B
Python
class Solution:
|
|
def floodFill(
|
|
self, image: List[List[int]], sr: int, sc: int, newColor: int
|
|
) -> List[List[int]]:
|
|
def dfs(i, j):
|
|
if (
|
|
not 0 <= i < m
|
|
or not 0 <= j < n
|
|
or image[i][j] != oc
|
|
or image[i][j] == newColor
|
|
):
|
|
return
|
|
image[i][j] = newColor
|
|
for a, b in pairwise(dirs):
|
|
dfs(i + a, j + b)
|
|
|
|
dirs = (-1, 0, 1, 0, -1)
|
|
m, n = len(image), len(image[0])
|
|
oc = image[sr][sc]
|
|
dfs(sr, sc)
|
|
return image
|