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);
        }
    };
  • 相关阅读:
    外设驱动库开发笔记5:AD7705系列ADC驱动
    ROS+LEDE最强上网软路由
    Flume1.9.0的安装、部署、简单应用(含分布式、与Hadoop3.1.2、Hbase1.4.9的案例)
    通过 Sqoop1.4.7 将 Mysql5.7、Hive2.3.4、Hbase1.4.9 之间的数据导入导出
    Hadoop 3.1.2(HA)+Zookeeper3.4.13+Hbase1.4.9(HA)+Hive2.3.4+Spark2.4.0(HA)高可用集群搭建
    Centos7 二进制安装 Kubernetes 1.13
    Centos7 使用 kubeadm 安装Kubernetes 1.13.3
    go get获取gitlab私有仓库的代码
    Nginx设置Https反向代理,指向Docker Gitlab11.3.9 Https服务
    Docker 创建 Bamboo6.7.1 以及与 Crowd3.3.2 实现 SSO 单点登录
  • 原文地址:https://www.cnblogs.com/amazingzoe/p/5724439.html
Copyright © 2011-2022 走看看