289. Game of Life

最新推荐文章于 2023-12-05 10:50:48 发布

richlaji

最新推荐文章于 2023-12-05 10:50:48 发布

阅读量238

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/richlaji/article/details/52761423

版权

LeetCode 专栏收录该内容

21 篇文章

订阅专栏

LeetCode

题目地址：https://leetcode.com/problems/game-of-life/
解题思路：当前状态用1个bit表示，可以把下一个状态和当前状态一起用2bit表示(next state， current state)，具体思路参考https://discuss.leetcode.com/topic/29054/easiest-java-solution-with-explanation
C++代码如下：

class Solution {
public:
    void gameOfLife(vector<vector<int>>& board) {
        if (board.size() == 0) return;
        int rowLen = board.size();
        int colLen = board[0].size();
        //move
        for (int i = 0; i < rowLen; i++) {
            for (int j = 0; j < colLen; j++) {
                int lives = livesNeighbour(board,i,j,rowLen,colLen);
                //is live
                if (board[i][j] & 1 == 1) {
                    if (lives == 2 || lives == 3) 
                        board[i][j] = 3;
                } else {
                    if (lives == 3)
                        board[i][j] = 2;
                }
            }
        }
        //state 2
        for (int i = 0; i < rowLen; i++) {
            for (int j = 0; j < colLen; j++) {
                board[i][j] >>= 1;
            }
        }
        return;
    }

    int max(int a, int b) {
        return a > b ? a : b;
    }
    int min(int a, int b) {
        return a < b ? a : b;
    }

    int livesNeighbour(vector<vector<int>>& board, int row, int col, int rowLen, int colLen) {
        int lives = 0;
        for (int i = max(row-1, 0); i <= min(row+1,rowLen-1); i++) {
            for (int j = max(col-1,0); j <= min(col+1,colLen-1); j++) {
                lives += board[i][j] & 1;
            }
        }
        lives -= board[row][col] & 1;
        return lives;
    }
};