0200-number-of-islands.md Renamed and formatted.

gazeldx · gazeldx · commit 779d02933e44 · 2024-12-13T18:19:36.000+08:00
diff --git a/problems/0200-number-of-islands-2.md b/problems/0200-number-of-islands-2.md
@@ -140,15 +140,15 @@ class Solution {
                 if (grid[i][j] == '1') {
                     islandCount++;
 
-                    breadthFirstSearch(new int[]{i, j});
+                    depthFirstSearch(new int[]{i, j});
                 }
             }
         }
 
         return islandCount;
     }
 
-    void breadthFirstSearch(int[] point) {
+    void depthFirstSearch(int[] point) {
         pointStack.push(point);
 
         while (!pointStack.empty()) {
@@ -193,6 +193,7 @@ private:
         while (!point_stack.empty()) {
             point = point_stack.top();
             point_stack.pop();
+
             int i = point[0];
             int j = point[1];
 
@@ -253,15 +254,15 @@ var numIslands = function (grid_) {
       if (item === '1') {
         islandCount++
 
-        breadthFirstSearch([i, j])
+        depthFirstSearch([i, j])
       }
     })
   })
 
   return islandCount
 };
 
-function breadthFirstSearch(point) {
+function depthFirstSearch(point) {
   pointStack.push(point)
 
   while (pointStack.length > 0) {
@@ -308,15 +309,15 @@ public class Solution
                 {
                     islandCount++;
 
-                    breadthFirstSearch([i, j]);
+                    depthFirstSearch([i, j]);
                 }
             }
         }
 
         return islandCount;
     }
 
-    void breadthFirstSearch(int[] point)
+    void depthFirstSearch(int[] point)
     {
         pointStack.Push(point);
 
diff --git a/problems/0200-number-of-islands.md b/problems/0200-number-of-islands.md
@@ -230,45 +230,42 @@ public:
 let grid
 
 var numIslands = function (grid_) {
-   grid = grid_
-   let islandCount = 0
+  grid = grid_
+  let islandCount = 0
 
-   grid.forEach((row, i) => {
-      row.forEach((item, j) => {
-         if (item === '1') {
-            islandCount++
+  grid.forEach((row, i) => {
+    row.forEach((item, j) => {
+      if (item === '1') {
+        islandCount++
 
-            depthFirstSearch([i, j])
-         }
-      })
-   })
+        depthFirstSearch([i, j])
+      }
+    })
+  })
 
-   return islandCount
+  return islandCount
 };
 
 function depthFirstSearch(point) {
-   const [i, j] = point
+  const [i, j] = point
 
-   if (i < 0 || i >= grid.length) {
-      return
-   }
+  if (i < 0 || i >= grid.length) {
+    return
+  }
 
-   if (j < 0 || j >= grid[0].length) {
-      return
-   }
+  if (j < 0 || j >= grid[0].length) {
+    return
+  }
 
-   if (grid[i][j] != '1') {
-      return
-   }
+  if (grid[i][j] != '1') {
+    return
+  }
 
-   grid[i][j] = 'V';
+  grid[i][j] = 'V';
 
-   [
-      [i - 1, j],
-      [i + 1, j],
-      [i, j - 1],
-      [i, j + 1]
-   ].forEach((adjacentPoint) => depthFirstSearch(adjacentPoint))
+  [[i - 1, j], [i, j + 1], [i + 1, j], [i, j - 1]].forEach(
+    (adjacentPoint) => depthFirstSearch(adjacentPoint)
+  )
 }
 ```
 
@@ -315,10 +312,7 @@ public class Solution
 
         grid[i][j] = 'V';
 
-        int[][] adjacentPoints = [
-            [i - 1, j], [i, j + 1],
-            [i + 1, j], [i, j - 1]
-        ];
+        int[][] adjacentPoints = [[i - 1, j], [i, j + 1], [i + 1, j], [i, j - 1]];
 
         foreach (var adjacentPoint in adjacentPoints) {
             depthFirstSearch(adjacentPoint);

Original file line number	Diff line number	Diff line change
`@@ -140,15 +140,15 @@ class Solution {`
`140`	`140`	`if (grid[i][j] == '1') {`
`141`	`141`	`islandCount++;`
`142`	`142`
`143`		`- breadthFirstSearch(new int[]{i, j});`
	`143`	`+ depthFirstSearch(new int[]{i, j});`
`144`	`144`	`}`
`145`	`145`	`}`
`146`	`146`	`}`
`147`	`147`
`148`	`148`	`return islandCount;`
`149`	`149`	`}`
`150`	`150`
`151`		`- void breadthFirstSearch(int[] point) {`
	`151`	`+ void depthFirstSearch(int[] point) {`
`152`	`152`	`pointStack.push(point);`
`153`	`153`
`154`	`154`	`while (!pointStack.empty()) {`
`@@ -193,6 +193,7 @@ private:`
`193`	`193`	`while (!point_stack.empty()) {`
`194`	`194`	`point = point_stack.top();`
`195`	`195`	`point_stack.pop();`
	`196`	`+`
`196`	`197`	`int i = point[0];`
`197`	`198`	`int j = point[1];`
`198`	`199`
`@@ -253,15 +254,15 @@ var numIslands = function (grid_) {`
`253`	`254`	`if (item === '1') {`
`254`	`255`	`islandCount++`
`255`	`256`
`256`		`- breadthFirstSearch([i, j])`
	`257`	`+ depthFirstSearch([i, j])`
`257`	`258`	`}`
`258`	`259`	`})`
`259`	`260`	`})`
`260`	`261`
`261`	`262`	`return islandCount`
`262`	`263`	`};`
`263`	`264`
`264`		`-function breadthFirstSearch(point) {`
	`265`	`+function depthFirstSearch(point) {`
`265`	`266`	`pointStack.push(point)`
`266`	`267`
`267`	`268`	`while (pointStack.length > 0) {`
`@@ -308,15 +309,15 @@ public class Solution`
`308`	`309`	`{`
`309`	`310`	`islandCount++;`
`310`	`311`
`311`		`- breadthFirstSearch([i, j]);`
	`312`	`+ depthFirstSearch([i, j]);`
`312`	`313`	`}`
`313`	`314`	`}`
`314`	`315`	`}`
`315`	`316`
`316`	`317`	`return islandCount;`
`317`	`318`	`}`
`318`	`319`
`319`		`- void breadthFirstSearch(int[] point)`
	`320`	`+ void depthFirstSearch(int[] point)`
`320`	`321`	`{`
`321`	`322`	`pointStack.Push(point);`
`322`	`323`