update 289

Author: rustykitty

0289-game-of-life.py

@@ -1,10 +1,10 @@
 """
 289. Game of Life
 
-Submitted: March 17, 2025
+Submitted: March 19, 2025
 
-Runtime: 2 ms (beats 23.06%)
-Memory: 17.70 MB (beats 94.61%)
+Runtime: 1 ms (beats 30.59%)
+Memory: 17.72 MB (beats 76.77%)
 """
 
 class Solution:
@@ -16,19 +16,15 @@ def gameOfLife(self, board: List[List[int]]) -> None:
 
         for i in range(len(board)):
             for j in range(len(board[0])):
-                n = self.sumOfNeighbors(board_copy, i, j)
+                n = sum(
+                    sum(
+                        board_copy[x][y] for y in range(max(0, j - 1), min(len(board_copy[0]), j + 2))
+                        if (x, y) != (i, j)
+                    )
+                    for x in range(max(0, i - 1), min(len(board_copy), i + 2))
+                )
                 if board_copy[i][j]:
                     if n < 2: board[i][j] = 0
                     elif n > 3: board[i][j] = 0
                 elif n == 3:
                     board[i][j] = 1
-                    
-
-    def sumOfNeighbors(self, board, i, j):
-        return sum(
-            sum(
-                board[x][y] for y in range(max(0, j - 1), min(len(board[0]), j + 2))
-                if (x, y) != (i, j)
-            )
-            for x in range(max(0, i - 1), min(len(board), i + 2))
-        )