[LeetCode] 289. Game of Life

题目：

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

答案：

思路：

这题唯一的难点在与如何使用O(1)的空间复杂度来解决问题，因为每个cell的状态需要同时更新。思路就是使用位运算。每个cell是一个int，但是实际上只用到了0,1，其他位都浪费掉了

所以解法是右边第一位保存现在的状态，右边第二位保存下一个状态，遍历完之后把右边第二位移到右边第一位就好了。

参考代码：

public class Solution {
    public void gameOfLife(int[][] board) {
        if (board == null || board.length == 0) return;
        
        int m = board.length;
        int 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);
                
                if (board[i][j] == 1 && (lives == 2 || lives == 3)) {
                    board[i][j] += 2;
                } else if (lives == 3) {
                    board[i][j] += 2;
                }
            }
        }
        
        for (int i = 0; i < m; i++)
            for (int j = 0; j < n; j++)
                board[i][j] >>= 1;
    }
    
    private 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;
    }
}