Game of Life

c++

class Solution {
public:
    void gameOfLife(vector<vector<int>>& board) {
        if (board.empty()) return;
        int m = board.size();
        int n = board[0].size();

        for (int i = 0; i < m; ++i) {
            for (int j = 0; j < n; ++j) {
                int lives = neighbors(board, i, j);
                // In the beginning, every 2nd bit is 0;
                // So we only need to care about when the 2nd bit will become 1.
                if (board[i][j] == 1 && lives >= 2 && lives <= 3) {
                    board[i][j] = 3; // Make the 2nd bit 1: 01 ---> 11
                }
                if (board[i][j] == 0 && lives == 3) {
                    board[i][j] = 2; // Make the 2nd bit 1: 00 ---> 10
                }
            }
        }
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                board[i][j] >>= 1;  // Get the 2nd state.
            }
        }
    }
private:
    int neighbors(const vector<vector<int>>& board, int i, int j) {
        int res = 0;
        int m = board.size();
        int n = board[0].size();
        for (int p = max(0, i - 1); p <= min(i + 1, m - 1); ++p) {
            for (int q = max(0, j - 1); q <= min(j + 1, n - 1); ++q) {
                res += board[p][q] & 1;
            }
        }
        res -= board[i][j] & 1;
        return res;
    }
};

reference:
https://leetcode.com/discuss/68352/easiest-java-solution-with-explanation