zoukankan      html  css  js  c++  java
  • 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?

    Analyse: You could use aid vector to record the transferred state, or set different values while transfer without the aid vector. 

    class Solution {
    public:
        // get the transfer state of board after one update
        vector<vector<int> > transferState(vector<vector<int> > &board) {
            vector<vector<int> > tempResult(board.size(), vector<int>(board[0].size(), -1));
            
            // compute the number of neighbours' 1
            for(int i = 0; i < board.size(); i++) {
                for(int j = 0; j < board[i].size(); j++) {
                    int neighbor = 0;
                    for(int m = i - 1; m <= i + 1; m++) {
                        if(m < 0 || m >= board.size()) continue;
                        for(int n = j - 1; n <= j + 1; n++) {
                            if(n < 0 || n >= board[i].size() || (m == i && n == j)) continue;
                            if(board[m][n] == 1) neighbor++;
                        }
                    }
                    
                    if(board[i][j] == 1) 
                        tempResult[i][j] = (neighbor == 2 || neighbor == 3) ? 1 : 0;
                    else
                        tempResult[i][j] = neighbor == 3 ? 1 : 0;
                }
            }
            return tempResult;
        }
        
        // compute the result after the transfer
        void computeResult (vector<vector<int> > tempResult, vector<vector<int> >& board) {
            for(int i = 0; i < board.size(); i++)
                for(int j = 0; j < board[i].size(); j++)
                    board[i][j] = tempResult[i][j];
        }
        
        void gameOfLife(vector<vector<int>>& board) {
            if(board.empty() || board[0].empty()) return;
            
            vector<vector<int> > tempResult = transferState(board);
            computeResult(tempResult, board);
        }
    };
  • 相关阅读:
    HDU5730 Shell Necklace
    BZOJ4883 [Lydsy2017年5月月赛]棋盘上的守卫
    Spring boot 配置文件
    org.joda.time.DateTime 日期操作
    Elasticsearch + Springboot 启动报错 java.net.ConnectException: Connection refused
    centos7 在docker下安装es Elasticsearch
    centos 7 。 docker 安装rabbitmq 以及集权搭建
    linux 安装mysql5.7.25
    安装rabbtimq CentOS 7
    docker + spring boot 打包 部署。
  • 原文地址:https://www.cnblogs.com/amazingzoe/p/5724439.html
Copyright © 2011-2022 走看看