leecode289

class Solution {
public:
    void gameOfLife(vector<vector<int>>& board) {
        int s = board.size();
        int s0 = board[0].size();
        vector<vector<int>> m(s, vector<int>(s0, 0));
        for (int i = 0; i < s; i++) {
            for (int j = 0; j < s0; j++) {
                int sum = 0;
                if (i - 1 >= 0 && j - 1 >= 0 && board[i - 1][j - 1])
                    sum++;
                if (i + 1 <= s - 1 && j + 1 <= s0 - 1 && board[i + 1][j + 1])
                    sum++;
                if (i - 1 >= 0 && board[i - 1][j])
                    sum++;
                if (i - 1 >= 0 && j + 1 < s0 && board[i - 1][j + 1])
                    sum++;
                if (j > 0 && board[i][j - 1])
                    sum++;
                if (j + 1 < s0 && board[i][j + 1])
                    sum++;
                if (j - 1 >= 0 && i + 1 <= s - 1 && board[i + 1][j - 1])
                sum++;
                if (i + 1 <= s - 1 && board[i + 1][j])
                    sum++;
                if (sum == 3)
                    m[i][j] = 1;
                else if (sum == 2 && board[i][j] == 1)
                    m[i][j] = 1;
            }
        }
        for (int i = 0; i < s; i++)
            for (int j = 0; j < s0; j++)
                if (m[i][j])
                    board[i][j] = 1;
                else
                    board[i][j] = 0;
    }
};

暴力即可,同样的,不能边遍历,边赋值