289. Game of Life-LeetCode(生命游戏)

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/WALLEZhe/article/details/50386271

先上题目:

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.
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?

开始的时候并没有都明白题目的意思,没有搞懂到底是要搞可以动态增长的还是不增长的。因为有这样两个单词(短语)。
in-place 和 in place
in-place的意思就是原地不动的,使用原来的地方,在题目中的意思就是不进行边界扩张。
in place 的意思是适当的,在适当的位置。

好的,这个坑跳过去了,其他的技能都还好。使用format输出进行调试是很方便的感觉。我的算法只击败了15%的人。

public class Solution {

    private boolean[][] flag; 
    public void gameOfLife(int[][] board) {
        int m=board.length;
        if(m==0){
            return ;
        }
        int n=board[0].length;

        flag=new boolean[m][n];
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                flagLife(i,j,board);
               // System.out.println(flag);
            }
        }
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){

               // System.out.format("flag %d,%d is %b\n",i,j,flag[i][j]);
            }
        }
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                if(flag[i][j]==true){
                    board[i][j]=1;
                   // System.out.format("board %d,%d =%d \n",i,j,board[i][j]);
                }else{
                    board[i][j]=0; 
                   // System.out.format("board %d,%d =%d \n",i,j,board[i][j]);
                }
            }
        }
    }
    void flagLife(int indexm,int indexn,int [][] board){
        int nbNum=getNbNum(indexm,indexn,board);
        if(nbNum<2||nbNum>3){
            flag[indexm][indexn]=false;
           // System.out.format("set flag %d,%d=%b\n",indexm,indexn,flag[indexm][indexn]);
        }else if (nbNum==2){
            if(board[indexm][indexn]==1){
                flag[indexm][indexn]=true;
               // System.out.format("set flag %d,%d=%b\n",indexm,indexn,flag[indexm][indexn]);
            }
            else{
                flag[indexm][indexn]=false;
                ///System.out.format("set flag %d,%d=%b\n",indexm,indexn,flag[indexm][indexn]);
            }
        }else {
            flag[indexm][indexn]=true;
           // System.out.format("set flag %d,%d=%b\n",indexm,indexn,flag[indexm][indexn]);
        }
    }
    int getNbNum(int indexm,int indexn,int [][] board){
        int lifeNum=0;
        for(int i=Math.max(indexm-1,0);i<=Math.min(indexm+1,board.length-1);i++){
            for(int j=Math.max(indexn-1,0);j<=Math.min(indexn+1,board[0].length-1);j++){

                if(board[i][j]==1){lifeNum++;}

            }
        }
        if(board[indexm][indexn]==1){
            lifeNum--;
        }
       // System.out.println("lifeNum is "+lifeNum);
        return lifeNum;
    }
}
展开阅读全文

没有更多推荐了,返回首页