modified solutions

Author: haklee

number-of-islands/haklee.py

@@ -24,21 +24,13 @@ class Solution:
     def numIslands(self, grid: List[List[str]]) -> int:
         minx, miny, maxx, maxy = 0, 0, len(grid[0]) - 1, len(grid) - 1
 
-        def check_inside(i, j):
-            # 그리드 안에 있는 칸인지 체크.
-            return minx <= j <= maxx and miny <= i <= maxy
-
         def remove_ground(i, j):
-            if grid[i][j] == "1":
+            if minx <= j <= maxx and miny <= i <= maxy and grid[i][j] == "1":
                 grid[i][j] = "0"
-                if check_inside(i - 1, j):
-                    remove_ground(i - 1, j)
-                if check_inside(i + 1, j):
-                    remove_ground(i + 1, j)
-                if check_inside(i, j - 1):
-                    remove_ground(i, j - 1)
-                if check_inside(i, j + 1):
-                    remove_ground(i, j + 1)
+                remove_ground(i - 1, j)
+                remove_ground(i + 1, j)
+                remove_ground(i, j - 1)
+                remove_ground(i, j + 1)
 
         sol = 0
         for i in range(maxy + 1):

set-matrix-zeroes/haklee.py

@@ -28,6 +28,7 @@ def setZeroes(self, matrix: List[List[int]]) -> None:
                 if matrix[i][j] == 0:
                     col_to_change.add(i)
                     row_to_change.add(j)
+
         for i in col_to_change:
             for j in range(n):
                 matrix[i][j] = 0