feat: update solutions to lc problem: No.0733

yanglbme · yanglbme · commit 6baeda7ef1ec · 2022-03-01T11:50:13.000+08:00
No.0733.Flood Fill
diff --git a/solution/0700-0799/0733.Flood Fill/README.md b/solution/0700-0799/0733.Flood Fill/README.md
@@ -40,14 +40,20 @@ sr = 1, sc = 1, newColor = 2
 
 <!-- 这里可写通用的实现逻辑 -->
 
-DFS。
+Flood fill 算法。
+
+Flood fill 算法是从一个区域中提取若干个连通的点与其他相邻区域区分开（或分别染成不同颜色）的经典算法。因为其思路类似洪水从一个区域扩散到所有能到达的区域而得名。
+
+最简单的实现方法是采用 DFS 的递归方法，也可以采用 BFS 的迭代来实现。
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
+DFS：
+
 ```python
 class Solution:
     def floodFill(self, image: List[List[int]], sr: int, sc: int, newColor: int) -> List[List[int]]:
@@ -62,6 +68,8 @@ class Solution:
         return image
 ```
 
+BFS：
+
 ```python
 class Solution:
     def floodFill(self, image: List[List[int]], sr: int, sc: int, newColor: int) -> List[List[int]]:
@@ -84,6 +92,8 @@ class Solution:
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
+DFS：
+
 ```java
 class Solution {
     private int[][] dirs = new int[][]{{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
@@ -105,6 +115,8 @@ class Solution {
 }
 ```
 
+BFS：
+
 ```java
 class Solution {
     public int[][] floodFill(int[][] image, int sr, int sc, int newColor) {
@@ -134,6 +146,8 @@ class Solution {
 
 ### **C++**
 
+DFS：
+
 ```cpp
 class Solution {
 public:
@@ -152,6 +166,8 @@ public:
 };
 ```
 
+BFS：
+
 ```cpp
 class Solution {
 public:
@@ -184,6 +200,8 @@ public:
 
 ### **Go**
 
+DFS：
+
 ```go
 func floodFill(image [][]int, sr int, sc int, newColor int) [][]int {
 	dfs(image, sr, sc, image[sr][sc], newColor)
@@ -202,6 +220,8 @@ func dfs(image [][]int, i, j, oc, nc int) {
 }
 ```
 
+BFS：
+
 ```go
 func floodFill(image [][]int, sr int, sc int, newColor int) [][]int {
 	if image[sr][sc] == newColor {
diff --git a/solution/0700-0799/0733.Flood Fill/README_EN.md b/solution/0700-0799/0733.Flood Fill/README_EN.md
@@ -62,10 +62,14 @@ to the starting pixel.
 
 DFS or BFS.
 
+> Flood fill, also called seed fill, is a flooding algorithm that determines and alters the area connected to a given node in a multi-dimensional array with some matching attribute. It is used in the "bucket" fill tool of paint programs to fill connected, similarly-colored areas with a different color.
+
 <!-- tabs:start -->
 
 ### **Python3**
 
+DFS:
+
 ```python
 class Solution:
     def floodFill(self, image: List[List[int]], sr: int, sc: int, newColor: int) -> List[List[int]]:
@@ -80,6 +84,8 @@ class Solution:
         return image
 ```
 
+BFS:
+
 ```python
 class Solution:
     def floodFill(self, image: List[List[int]], sr: int, sc: int, newColor: int) -> List[List[int]]:
@@ -100,6 +106,8 @@ class Solution:
 
 ### **Java**
 
+DFS:
+
 ```java
 class Solution {
     private int[][] dirs = new int[][]{{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
@@ -121,6 +129,8 @@ class Solution {
 }
 ```
 
+BFS:
+
 ```java
 class Solution {
     public int[][] floodFill(int[][] image, int sr, int sc, int newColor) {
@@ -150,6 +160,8 @@ class Solution {
 
 ### **C++**
 
+DFS:
+
 ```cpp
 class Solution {
 public:
@@ -168,6 +180,8 @@ public:
 };
 ```
 
+BFS:
+
 ```cpp
 class Solution {
 public:
@@ -200,6 +214,8 @@ public:
 
 ### **Go**
 
+DFS:
+
 ```go
 func floodFill(image [][]int, sr int, sc int, newColor int) [][]int {
 	dfs(image, sr, sc, image[sr][sc], newColor)
@@ -218,6 +234,8 @@ func dfs(image [][]int, i, j, oc, nc int) {
 }
 ```
 
+BFS:
+
 ```go
 func floodFill(image [][]int, sr int, sc int, newColor int) [][]int {
 	if image[sr][sc] == newColor {
diff --git a/solution/0700-0799/0733.Flood Fill/Solution.ts b/solution/0700-0799/0733.Flood Fill/Solution.ts
@@ -7,7 +7,6 @@ function floodFill(
     const m = image.length;
     const n = image[0].length;
     const target = image[sr][sc];
-    // 递归函数
     const dfs = (i: number, j: number) => {
         if (
             i < 0 ||
