思路:
这题的关键在于不能一个一个的更新,每一个位置都要按照原来的周围环境进行更新,也可以理解为同时更新。
用0作为界限来区分活细胞还是死细胞。一次遍历,特殊标记,再次遍历复原即可。
特殊的点为:原来是活的,更新后死了,原来是死的,更新后活了。
class Solution:
def gameOfLife(self, board: List[List[int]]) -> None:
"""
Do not return anything, modify board in-place instead.
"""
row = len(board)
col = len(board[0])
for i in range(row) :
for j in range(col):
count = self.dfs(i,j,board)
if board[i][j] > 0: #活细胞,dfs后死了的用2标记,还是活的不管
if count < 2 or count > 3:
board[i][j] = 2
else: #死细胞,dfs后变活的用-1标记,还是死的不管
if count == 3:
board[i][j] = -1
#特殊标记的再变回来
for i in range(row):
for j in range(col):
if board[i][j] == 2:
board[i][j] = 0
if board[i][j] == -1:
board[i][j] = 1
return board
def dfs(self,i,j,board):
dx = [-1,0,1,-1,1,-1,0,1]
dy = [-1,-1,-1,0,0,1,1,1]
count = 0
for k in range(8):
x = i + dx[k]
y = j + dy[k]
if x < 0 or x >= len(board) or y < 0 or y >= len(board[0]):
continue
elif board[x][y] > 0:
count += 1
return count