733

Author: ProHiryu

DFS/traditionalDFS/733.md

@@ -0,0 +1,31 @@
+## Flood Fill
+
+#### Description
+
+[link](https://leetcode.com/problems/flood-fill/description/)
+
+---
+
+#### Solution
+
+- See Code
+
+---
+
+#### Code
+
+> 最坏情况：O(n^2)
+
+```python
+class Solution:
+    def floodFill(self, image: List[List[int]], sr: int, sc: int, newColor: int) -> List[List[int]]:
+        rows, cols, orig_color = len(image), len(image[0]), image[sr][sc]
+        def traverse(row, col):
+            if (not (0 <= row < rows and 0 <= col < cols)) or image[row][col] != orig_color:
+                return
+            image[row][col] = newColor
+            [traverse(row + x, col + y) for (x, y) in ((0, 1), (1, 0), (0, -1), (-1, 0))]
+        if orig_color != newColor:
+            traverse(sr, sc)
+        return image
+```