[LeetCode] (medium) 289. Game of Life

https://leetcode.com/problems/game-of-life/

According to the 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."

Given a board with m by n cells, each cell has an initial state live (1) or dead (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.

Write a function to compute the next state (after one update) of the board given its current state. The next state is created by applying the above rules simultaneously to every cell in the current state, where births and deaths occur simultaneously.

Example:

Input: 
[
  [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]
]

Follow up:

1. Could you solve it in-place? Remember that the board needs to be updated at the same time: You cannot update some cells first and then use their updated values to update other cells.
2. 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 the border of the array. How would you address these problems?

---

本质都是用的标记法，需要二次扫描，但是怎么做标记有讲究，我是用了-1和2代表改变，但其实可以利用二进制表示法的第二位来做标记，二次扫描的时候直接将每个格子的数字右移一位即可，算是个小小的优化

 

class Solution {
public:
    int row, col;
    int r_step[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
    int c_step[8] = {0, 1, 1, 1, 0, -1, -1, -1};
    
    //  1 -> live
    //  2 -> live but should die
    //  0 -> die
    // -1 -> die but should live
    
    void gameOfLife(vector<vector<int>>& board) {
        if(board.size() == 0) return;
        
        row = board.size();
        col = board[0].size();
        
        for(int i = 0; i < row; ++i){
            for(int j = 0; j < col; ++j){
                // cout << i << ' ' << j << endl;
                if(board[i][j] == 1){
                    if(should_die(board, i, j)) board[i][j] = 2;
                }else{
                    if(should_live(board, i, j)) board[i][j] = -1;
                }
            }
        }
        
        for(int i = 0; i < row; ++i){
            for(int j = 0; j < col; ++j){
                if(board[i][j] == 2) board[i][j] = 0;
                else if(board[i][j] == -1) board[i][j] = 1;
            }
        }
        
        return;
        
    }
    
    bool should_live(vector<vector<int>>& board, int r, int c){
        int cur_r, cur_c;
        int cnt = 0;
        for(int i = 0; i < 8; ++i){
            cur_r = r + r_step[i];
            cur_c = c + c_step[i];
            if(cur_r < 0 || cur_r >= row || cur_c < 0 || cur_c >= col){
                continue;
            }else{
                if(board[cur_r][cur_c] > 0){
                    ++cnt;
                }
            }
        }
        return cnt == 3;
    }
    
    bool should_die(vector<vector<int>>& board, int r, int c){
        int cur_r, cur_c;
        int cnt = 0;
        for(int i = 0; i < 8; ++i){
            cur_r = r + r_step[i];
            cur_c = c + c_step[i];
            if(cur_r < 0 || cur_r >= row || cur_c < 0 || cur_c >= col){
                continue;
            }else{
                if(board[cur_r][cur_c] > 0){
                    ++cnt;
                }
            }
        }
        return !(cnt == 3 || cnt == 2);
    }
};

---

别人的代码：

// Save your bits
class Solution {
public:
    void gameOfLife(vector<vector<int>>& board) {
        int n = board.size();
        int m = n > 0 ? board[0].size() : 0;
        if (n == 0 || m == 0) {
            return;
        }
        int i, j, k;
        static const int d[8][2] = {
            {-1, -1}, {-1, +1}, {+1, -1}, {+1, +1}, 
            {-1, 0}, {+1, 0}, {0, -1}, {0, +1}
        };
        
        int cnt;
        int i1, j1;
        for (i = 0; i < n; ++i) {
            for (j = 0; j < m; ++j) {
                cnt = 0;
                for (k = 0; k < 8; ++k) {
                    i1 = i + d[k][0];
                    if (i1 < 0 || i1 > n - 1) {
                        continue;
                    }
                    j1 = j + d[k][1];
                    if (j1 < 0 || j1 > m - 1) {
                        continue;
                    }
                    if (board[i1][j1] & 1) {
                        ++cnt;
                    }
                }
                if (board[i][j] & 1) {
                    if (cnt >= 2 && cnt <= 3) {
                        board[i][j] |= 2;
                    }
                } else {
                    if (cnt == 3) {
                        board[i][j] |= 2;
                    }
                }
            }
        }
        for (i = 0; i < n; ++i) {
            for (j = 0; j < m; ++j) {
                board[i][j] >>= 1;
            }
        }
    }
};