LeetCode Top Interview Questions 289. Game of Life (Java版; Medium)

welcome to my blog

LeetCode Top Interview Questions 289. Game of Life (Java版; Medium)

题目描述

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:

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?

第二次做; 核心: 1)需要一个数字能同时表示细胞的旧状态和新状态; 因为状态只有两个, 所以考虑使用bit位去记录

/*
原地修改的核心: 细胞状态改变后既能知道改变后的状态, 也能知道原先的细胞状态; 用一个数字表示两种状态, 一个是之前的状态, 一个是之后的状态
00表示状态从0变成0
01表示状态从1变成0
11表示状态从1变成1
01表示状态从1变成0
*/
class Solution {
    public void gameOfLife(int[][] board) {
        int m = board.length, n = board[0].length;
        if(m==0 || n==0){
            return;
        }
        int[][] moves = {{-1,0},{1,0},{0,-1},{0,1},{-1,-1},{1,-1},{-1,1},{1,1}};
        for(int i=0; i<m; i++){
            for(int j=0; j<n; j++){
                int x, y;
                int live=0, dead=0;
                for(int[] move : moves){
                    x = i + move[0];
                    y = j + move[1];
                    if(x>=0 && x<m && y>=0 && y<n){
                        live = (board[x][y] & 1)==1? live+1 : live;
                        dead = (board[x][y] & 1)==0? dead+1 : dead;
                    }
                }
                if(board[i][j]==1){
                    if(live==2 || live==3){
                        board[i][j] = 3; //11
                    }else{
                        board[i][j] = 1; //01
                    }
                }else{
                    if(live == 3){
                        board[i][j] = 2;
                    }
                }
            }
        }

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

第一次做;核心:0,1保持不变; -1表示之前是live,需要修改成dead; -2表示之前是dead,需要修改成live, 相当于是用了四个数表示每个状态的变化, 0表示current是0,next是0; 1表示current是1,next是1; -1表示current是1,next是0; -2表示current是0,next是1; 所以可以用4bit信息表示状态的变化, 注意: 并不是表示状态, 而是表示状态的变化, 当然了, 也可以把状态的变化看作是一个状态… 要理解并记住最优解; 我用的方法和最优解本质是一样的,但是我没有意识到新旧状态一共有4种组合, 所以也没有意识到可以用4bit表示4种状态

class Solution {
    public void gameOfLife(int[][] board) {
        if(board==null || board.length==0 || board[0]==null || board[0].length==0)
            return;
        int rows = board.length, cols = board[0].length;
        //第一遍遍历矩阵, 确定每个点的状态
        for(int i=0; i<rows; i++){
            for(int j=0; j<cols; j++){
                //注意处理的是谁!
                boolean flag = isLive(board, i, j);
                int cur = board[i][j];
                if(flag==true && cur==1) continue;
                else if(flag==true && cur==0) board[i][j]=-2;
                else if(flag==false && cur==1) board[i][j]=-1;
                else if(flag==false && cur==0) continue;
            }
        }
        /*
        第二遍遍历矩阵, 更改每个点的状态
        核心:0,1保持不变; -1表示之前是live,需要修改成dead; -2表示之前是dead,需要修改成live
        */ 
        for(int i=0; i<rows; i++){
            for(int j=0; j<cols; j++){
                int cur = board[i][j];
                if(cur==0||cur==1) continue;
                if(cur==-1)board[i][j]=0;
                else if(cur==-2)board[i][j]=1;
            }
        }
    }
    public boolean isLive(int[][] board, int i, int j){
        int rows = board.length, cols = board[0].length;
        int live=0, dead=0;
        //当前坐标(i,j)的变化范围
        int up = Math.max(i-1, 0);
        int down = Math.min(rows-1, i+1);
        int left = Math.max(j-1, 0);
        int right = Math.min(j+1, cols-1);
        for(int row=up; row<=down; row++){
            for(int col=left; col<=right; col++){
                //处理周围节点,最多8个,最少3个, 其实只有三种情况:3, 5, 8
                int cur = board[row][col];
                if(cur==1 || cur==-1){
                    live++;
                }
                else if(cur==0 || cur==-2){
                    dead++;
                }
            }
        }
        int tmp = board[i][j];
        //因为刚才的双层for循环考虑了board[i][j]的影响, board[i][j]是(i,j)自己,不是(i,j)周围的点, 所以去掉自己的影响
        if(tmp==1||tmp==-1) live--;
        else if(tmp==0 || tmp==-2) dead--;
        if(tmp==0 || tmp==-2)
            return live==3;
        if(tmp==1 || tmp==-1){
            if(live==2 || live==3)
                return true;
            return false;
        }
        //unused return
        return false;
    }
}

LeetCode最优解;In the end, delete every cell’s 1st state by doing >> 1这个操作非常秀; 1st bit是二进制中的低位, 2st是二进制中的高位; 遍历邻居节点时,先分别确定横纵坐标的变化范围, 然后使用循环进行处理, 并且在循环外部单独消除自己的影响, 真巧妙啊! 移位操作也是相当的巧妙; 简直完美的最优解

某个人的分析, 感觉很重要的一点是, 将新旧状态作为最基本的分析粒度,然后考虑了新旧状态一共4种组合,进而用二进制及位运算操作
The idea is pretty simple and nothing creative. My line of thinking was:

If I want to reuse the existing space, I'd need to store both the old and new states in each cell.
There are 4 combinations of old and new values: 00, 01, 10, 11.
I can either use the first or second bit for the old value.
I tried both. Both work. Using the first bit for the old value, however, uses 1 fewer loop.

To solve it in place, we use 2 bits to store 2 states:

[2nd bit, 1st bit] = [next state, current state]

- 00  dead (next) <- dead (current)
- 01  dead (next) <- live (current)  
- 10  live (next) <- dead (current)  
- 11  live (next) <- live (current) 
In the beginning, every cell is either 00 or 01.
Notice that 1st state is independent of 2nd state.
Imagine all cells are instantly changing from the 1st to the 2nd state, at the same time.
Let's count # of neighbors from 1st state and set 2nd state bit.
Since every 2nd state is by default dead, no need to consider transition 01 -> 00.
In the end, delete every cell's 1st state by doing >> 1.
For each cell's 1st bit, check the 8 pixels around itself, and set the cell's 2nd bit.

Transition 01 -> 11: when board == 1 and lives >= 2 && lives <= 3.
Transition 00 -> 10: when board == 0 and lives == 3.
To get the current state, simply do

board[i][j] & 1
To get the next state, simply do

board[i][j] >> 1
Hope this helps!

public void gameOfLife(int[][] board) {
    if (board == null || board.length == 0) return;
    int m = board.length, n = board[0].length;

    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            int lives = liveNeighbors(board, m, n, i, j);

            // In the beginning, every 2nd bit is 0;
            // So we only need to care about when will the 2nd bit become 1.
            if (board[i][j] == 1 && lives >= 2 && lives <= 3) {  
                board[i][j] = 3; // Make the 2nd bit 1: 01 ---> 11
            }
            if (board[i][j] == 0 && lives == 3) {
                board[i][j] = 2; // Make the 2nd bit 1: 00 ---> 10
            }
        }
    }

    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            board[i][j] >>= 1;  // Get the 2nd state.
        }
    }
}

public int liveNeighbors(int[][] board, int m, int n, int i, int j) {
    int lives = 0;
    for (int x = Math.max(i - 1, 0); x <= Math.min(i + 1, m - 1); x++) {
        for (int y = Math.max(j - 1, 0); y <= Math.min(j + 1, n - 1); y++) {
            lives += board[x][y] & 1;
        }
    }
    lives -= board[i][j] & 1;
    return lives;
}