-
-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathgameOfLife.py
37 lines (31 loc) · 1.17 KB
/
gameOfLife.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
class Solution:
def gameOfLife(self, board: List[List[int]]) -> None:
"""
Do not return anything, modify board in-place instead.
"""
# 0,2 - dead, dead->live
# 1,3 - live, live->dead
def neighbors(r,c):
for nr, nc in ((r,c-1), (r,c+1),(r-1,c),(r+1,c),(r-1,c-1),
(r+1,c+1),(r-1,c+1),(r+1,c-1)):
if 0<=nr<R and 0<=nc<C:
yield nr, nc
R = len(board)
C = len(board[0])
for r in range(R):
for c in range(C):
cnt = 0
for x,y in neighbors(r,c):
cnt += board[x][y] % 2
if board[r][c] == 0:
if cnt == 3:
board[r][c] = 2
else:
if cnt < 2 or cnt > 3:
board[r][c] = 3
for r in range(R):
for c in range(C):
if board[r][c] == 2:
board[r][c] = 1
elif board[r][c] == 3:
board[r][c] = 0