leetcode-289 - Game of Life

動機

用數字代表狀態變化

Problem

According to Wikipedia's article: The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970.

The board is made up of an m x n grid of cells, where each cell has an initial state: live (represented by a 1) or dead (represented by a 0). Each cell interacts with its eight neighbors (horizontal, vertical, diagonal) using the following four rules (taken from the above Wikipedia article):

1. Any live cell with fewer than two live neighbors dies as if caused by under-population.
2. Any live cell with two or three live neighbors lives on to the next generation.
3. Any live cell with more than three live neighbors dies, as if by over-population.
4. Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.

The next state is created by applying the above rules simultaneously to every cell in the current state, where births and deaths occur simultaneously. Given the current state of the m x n grid board, return the next state.

Example 1:

Input: board = [[0,1,0],[0,0,1],[1,1,1],[0,0,0]]Output: [[0,0,0],[1,0,1],[0,1,1],[0,1,0]]

Example 2:

Input: board = [[1,1],[1,0]]Output: [[1,1],[1,1]]

Constraints:

• m == board.length
• n == board[i].length
• 1 <= m, n <= 25
• board[i][j] is 0 or 1.

Follow up:

• Could you solve it in-place? Remember that the board needs to be updated simultaneously: You cannot update some cells first and then use their updated values to update other cells.
• In this question, we represent the board using a 2D array. In principle, the board is infinite, which would cause problems when the active area encroaches upon the border of the array (i.e., live cells reach the border). How would you address these problems?

Sol

class Solution:
    def count(self,i,j):
        pos = [[i-1,j-1],[i-1,j],[i-1,j+1], \
                [i,j-1],        [i,j+1], \
               [i+1,j-1],[i+1,j],[i+1,j+1]]
        dirs = [p for p in pos if 0 <= p[0] and p[0] < len(self.b) and 0 <= p[1] and p[1] < len(self.b[0])]
        ret = 0
        for d in dirs:
            if self.b[d[0]][d[1]] > 0:
                ret += 1
        return ret
    def trans(self,i,j,live_die):
        if self.b[i][j] != live_die:
            if self.b[i][j] == 0:
                self.b[i][j] = -1
            else:
                self.b[i][j] = 2
    def gameOfLife(self, board: List[List[int]]) -> None:
        """
        Do not return anything, modify board in-place instead.
        """
        # 0: 0 -> 0
        # 1: 1 -> 1
        # -1: 0 -> 1
        # 2: 1 -> 0
        self.b = board
        # transition
        for i in range(len(self.b)):
            for j in range(len(self.b[0])):
                cnt = self.count(i,j)
                if cnt < 2:
                    self.trans(i,j,0)
                elif cnt == 2:
                    continue
                elif cnt == 3:
                    self.trans(i,j,1)
                else:
                    self.trans(i,j,0)
        # fix board
        for i in range(len(self.b)):
            for j in range(len(self.b[0])):
                if self.b[i][j] == -1:
                    self.b[i][j] = 1
                elif self.b[i][j] == 2:
                    self.b[i][j] = 0