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?

题意：

给定一个 m * n的二维数组，其中数组中的每个元素分别是1和0，其中1表示的是活着，0表示的是死了。其中有4条法则表示下一个时刻，这个格子中的数是处于活着还是死的状态。此题我采用将原来的二维数组重新赋给一个新的二维数组，然后采用一个新的方法，就是计算该格子的左，右，上，下，左上，右上，左下，右下的8个格子的活与死的情况，然后分别代入到上述4条法则中，看下一时刻究竟这个格子的生死状况。

public void gameOfLife(int[][] board)
	{
		int rowlength = board.length;
		int collength = board[0].length;
		int[][] result = new int[rowlength][collength];
		if(board == null)
			return;
		if(rowlength == 1 && collength == 1)
		{
			if(board[0][0] == 1)
				board[0][0] = 0;
			return;
		}
		for(int i = 0; i < rowlength; i++)
		{
			for(int j = 0; j < collength; j++)
				result[i][j] = board[i][j];
		}
		for(int i = 0; i < rowlength; i++)
		{
			for(int j = 0; j < collength; j++)
			{
				int count = getLiveNum(result,i,j);
				if(result[i][j] == 1)
				{
					
					if(count <2)
						board[i][j] = 0;
					else if(count > 3)
						board[i][j] = 0;
				}
				else 
				{
					if(count == 3)
						board[i][j] = 1;
				}
			}
		}
	}
	public int getLiveNum(int[][] nums,int x,int y)
	{
		int count = 0;
		for(int i = x - 1; i <= x + 1; i++)
		{
			for(int j = y - 1; j <= y + 1; j++)
			{
				if(i < 0 || j < 0 || i > nums.length - 1 || j > nums[0].length - 1 || (i == x)&&(j == y))
					continue;
				if(nums[i][j] == 1)
					count++;
			}
		}
		return count;
	}