289. 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):

Any live cell with fewer than two live neighbors dies, as if caused by under-population.
Any live cell with two or three live neighbors lives on to the next generation.
Any live cell with more than three live neighbors dies, as if by over-population…
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:

grandyang：https://www.cnblogs.com/grandyang/p/4854466.html

思路：

规则如下：

1. 如果活细胞周围八个位置的活细胞数少于两个，则该位置活细胞死亡
2. 如果活细胞周围八个位置有两个或三个活细胞，则该位置活细胞仍然存活
3. 如果活细胞周围八个位置有超过三个活细胞，则该位置活细胞死亡
4. 如果死细胞周围正好有三个活细胞，则该位置死细胞复活

由于不能使用额外的空间，那么就要用原位数字记录这个转换信息。采用如下的code：

状态0： 0ー＞0
状态1： 1ー＞1
状态2： 1ー＞0
状态3： 0ー＞1

那么算法就比较明显了：按顺序遍历整个棋盘，对每个位置的up to 8 neighbors进行计数，更新当前位置。计数的时候，如果neighbor的状态是1 或者2，都算live neighbor。那么在遍历结束后，对每一个位置%2，所得结果就是该位置的生存状态。

易错点

1. 这里第一句判edge case的方法和comment掉的一样，但是比较精妙。
2. 遍历8 neighbor的方法是模版级的，要多练几遍。

Complexity

Time complexity: O(mn)
Space complexity: O(1)

class Solution {
public:
    void gameOfLife(vector<vector<int>>& board) {
        // if (!board.size() || !board[0].size()) return;
        int m = board.size(), n = m ? board[0].size() : 0;
        int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
        int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                int count = 0;
                for (int k = 0; k < 8; k++) {
                    int x = i + dx[k], y = j + dy[k];
                    if (x >= 0 && x < m && y >= 0 && y < n && (board[x][y] == 1 || board[x][y] == 2)) {
                        count ++;
                    }
                }
                // 1 -> 0
                if (board[i][j] && (count < 2 || count > 3)) board[i][j] = 2;
                // 0 -> 1
                if (!board[i][j] && count == 3) board[i][j] = 3;
                
            }
        }
        
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                board[i][j] %= 2;
            }
        }
        return;
    }
};