leetcode 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):

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.

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?

Credits:

Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

这道题的解题思路是状态机，博客http://www.cnblogs.com/grandyang/p/4854466.html我认为讲的非常清楚，大家可以直接看，第一次见到这种题型还是挺难想到思路的，代码：

private int x[]={-1,-1,-1,0,0,1,1,1};private int y[]={-1,0,1,1,-1,1,0,-1};public void gameOfLife(int[][] board) {    int m=board.length;    int n=board[0].length;    for(int i=0;i<m;i++){        for(int j=0;j<n;j++){            if(board[i][j]==1&&(search(i,j,board)>3||search(i,j,board)<2)){                board[i][j]=2;            }            else if(board[i][j]==0&&search(i,j,board)==3) board[i][j]=3;        }    }    for(int i=0;i<m;i++){        for(int j=0;j<n;j++){            board[i][j]%=2;        }    }}public int search(int i,int j,int[][] array){    int count=0;    for(int m=0;m<8;m++){        int xray=i+x[m];        int yray=j+y[m];        if(xray>=0&&xray<array.length&&yray>=0&&yray<array[0].length&&(array[xray][yray]==1||array[xray][yray]==2)){            count++;        }    }    return count;}