LeetCode-289-生命游戏-矩阵-模拟_生命游戏创建一个整型矩阵,对矩形矩阵赋值并打印输出-CSDN博客

本文链接：https://blog.csdn.net/Mr_Ghost812/article/details/124934797

这段代码展示了两种实现生命游戏的方式。第一种是通过创建新的状态数组res，第二种则是直接在原数组board上进行2dead->alive和3alive->dead的状态转换。代码遍历每个细胞，检查其周围活细胞的数量，根据生命游戏的规则更新细胞状态。

摘要由CSDN通过智能技术生成

原题链接
在这里插入图片描述

代码如下：开个新数组

class Solution {
public:
    void gameOfLife(vector<vector<int>>& board) {
        int n = board.size(), m = board[0].size();
        vector<vector<int>> res(n, vector<int>(m));
        int dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0}, dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};

        for(int i = 0; i < n; i ++)
            for(int j = 0; j < m; j ++){
                int alive = 0, dead = 0;
                for(int k = 0; k < 8; k ++){
                    int a = i + dx[k], b = j + dy[k];
                    if(a < 0 || a >= n || b < 0 || b >= m)  continue;
                    else if(board[a][b] == 1)
                        alive ++;
                }
                if(board[i][j] == 1 && alive < 2)   res[i][j] = 0;
                else if(board[i][j] == 1 && alive == 2 || alive == 3)   res[i][j] = 1;
                else if(board[i][j] == 1 && alive > 3)  res[i][j] = 0;
                else if(board[i][j] == 0 && alive == 3) res[i][j] = 1;
            }
        for(int i = 0; i < n; i ++)
            for(int j = 0; j < m; j ++)
                board[i][j] = res[i][j];
    }
};

代码如下：开个新状态，2 dead -> alive, 3 alive -> dead

class Solution {
public:
    void gameOfLife(vector<vector<int>>& board) {
        int n = board.size(), m = board[0].size();
        vector<vector<int>> res(n, vector<int>(m));
        int dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0}, dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};

        for(int i = 0; i < n; i ++)
            for(int j = 0; j < m; j ++){
                int alive = 0;
                for(int k = 0; k < 8; k ++){
                    int a = i + dx[k], b = j + dy[k];
                    if(a < 0 || a >= n || b < 0 || b >= m)  continue;
                    else if(board[a][b] == 1)   alive ++;
                    else if(board[a][b] == 3)   alive ++;
                }

                //2 dead -> alive, 3 alive -> dead
                if(board[i][j] == 1 && alive < 2)   board[i][j] = 3;
                else if(board[i][j] == 1 && (alive == 2 || alive == 3) )    board[i][j] = 1;
                else if(board[i][j] == 1 && alive > 3)  board[i][j] = 3;
                else if(board[i][j] == 0 && alive == 3) board[i][j] = 2;
                
            }
            
        for(int i = 0; i < n; i ++)
            for(int j = 0; j < m; j ++)
                if(board[i][j] == 2)    board[i][j] = 1;
                else if(board[i][j] == 3)   board[i][j] = 0;
    }
};