[Leectode] 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.

Follow up:

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.

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?

翻译一下题，这是著名的 Game of Life ，是一种细胞自动机。每一个位置有两种状态，1为活细胞，0为死细胞，对于每个位置都满足如下的条件：

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

要求求出每个位置的下一状态，并且需要 in-place 。

分析

因为要求就地算法，我们需要找个方法知道每个细胞变化前以及变化后的状态，因此，我们可以将所有的细胞分为以下四种状态：

状态0： 死细胞转为死细胞
状态1： 活细胞转为活细胞
状态2： 活细胞转为死细胞
状态3： 死细胞转为活细胞

于是，通过查看每个细胞的状态，我们就可以知道它变化前以及变化后是死的还是活的。

有了这个之后，接下来的工作就是遍历每个细胞，根据规则，更新它的状态。

最后，状态为0和2的最终变成死细胞，状态为1和3的最终变成活细胞。

代码

class Solution {
public:
    void gameOfLife(vector<vector<int>>& board) {
        if (board.empty() || board[0].empty()) return;
        int m = board.size(), n = board[0].size();

        const int D_D = 0, L_L = 1, L_D = 2, D_L = 3;

        int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
        int dy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                int cnt = 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] == L_L || board[x][y] == L_D))
                        cnt++;
                }
                if (board[i][j] == L_L && (cnt < 2 || cnt > 3)) board[i][j] = L_D;
                else if (board[i][j] == D_D && cnt == 3) board[i][j] = D_L;
            }
        }

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++)
                board[i][j] %= 2;
        }
    }
};