zoukankan      html  css  js  c++  java
  • leetcode@ [289] Game of Life (Array)

    https://leetcode.com/problems/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?
    struct neighbor{
        int dies, lives;
        neighbor() {dies = 0; lives = 0;}
        neighbor(int d, int l): dies(d), lives(l) {}
    };
    class Solution {
    public:
        bool check(int m, int n, int a, int b) {
            if(a<0 || a>=m || b<0 || b>=n) return false;
            return true;
        }
        void gameOfLife(vector<vector<int>>& board) {
            if(board.size() == 0) return;
            
            int m = board.size(), n = board[0].size(), ni, nj;
            int dir[8][2] = {{-1,0},{-1,-1},{-1,1},{0,-1},{0,1},{1,0},{1,-1},{1,1}};
            vector<vector<int> > res(m, vector<int>(n));
            neighbor neg[m][n];
            
            for(int i=0;i<m;++i) {
                for(int j=0;j<n;++j) {
                    for(int k=0;k<8;++k) {
                        ni = i + dir[k][0]; nj = j + dir[k][1];
                        if(check(m, n, ni, nj)) {
                            if(board[ni][nj] == 1) ++neg[i][j].lives;
                            else ++neg[i][j].dies;
                        }
                    }
                }
            }
            
            for(int i=0;i<m;++i) {
                for(int j=0;j<n;++j) {
                    if(board[i][j] && neg[i][j].lives < 2) res[i][j] = 0;
                    else if(board[i][j] && (neg[i][j].lives == 2 || neg[i][j].lives == 3)) res[i][j] = 1;
                    else if(board[i][j] && neg[i][j].lives > 3) res[i][j] = 0;
                    else if(!board[i][j] && neg[i][j].lives == 3) res[i][j] = 1;
                    else res[i][j] = board[i][j];
                }
            }
            
            board = res;
        }
    };
    leetcode 289: Game of Life
  • 相关阅读:
    idea Ctrl+Alt+向下箭头 复制不起作用问题解决
    @Data 注解使用
    idea class类增加注释
    mysql 固定用户赋值数据库权限
    springboot logback 详细配置
    gitblit 增加ssh key
    uniapp内嵌H5页面和uniapp页面相互传值
    博客搬家
    反编译,java字节流 ,wirshark抓包,php转换中文
    charles 双向抓包
  • 原文地址:https://www.cnblogs.com/fu11211129/p/5018138.html
Copyright © 2011-2022 走看看