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?

 

class Solution {
public:
    //在原有基础上改
    void gameOfLife(vector<vector<int>>& board) {
        int m = board.size();
        if(m == 0) return;
        int n= board[0].size();
        //vector<vector<int>> pre = board;
        vector<vector<int>> dirs = {{0,1},{0,-1},{1,0},{-1,0},{1,1},{1,-1},{-1,1},{-1,-1}};
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                int liveNum = 0;
                for(int p=0;p<dirs.size();p++){
                    if(i+dirs[p][0]>=0&&i+dirs[p][0]<m&&j+dirs[p][1]>=0&&j+dirs[p][1]<n){
                        (board[i+dirs[p][0]][j+dirs[p][1]]&1) == 1 ? liveNum++:liveNum;
                    }  
                }
                //原来board中 有 01 00 这两种情况。
                if(board[i][j] & 1){
                    //保持当前位为1，后一位为0
                    if(liveNum < 2) board[i][j] = 1;
                    if(liveNum > 3) board[i][j] = 1;
                    //11 保持当前位为1，后一位也为1
                    if(liveNum>=2&&liveNum<=3) board[i][j]=3;
                }else{
                    //10 保持当前位为0，后一位为1
                    if(liveNum == 3) board[i][j] = 2;
                }     
            }
        }
        //获取borad cur位的情况
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                board[i][j] = board[i][j] >>1;
            }
        }
        return;
    }
};