g0201_0300.s0289_game_of_life.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0201_0300.s0289_game_of_life;
// #Medium #Top_Interview_Questions #Array #Matrix #Simulation
// #2022_07_06_Time_0_ms_(100.00%)_Space_42.9_MB_(10.73%)
public class Solution {
public void gameOfLife(int[][] board) {
int m = board.length;
int n = board[0].length;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
int lives = lives(board, i, j, m, n);
if (board[i][j] == 0 && lives == 3) {
board[i][j] = 2;
} else if (board[i][j] == 1 && (lives == 2 || lives == 3)) {
board[i][j] = 3;
}
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
board[i][j] >>= 1;
}
}
}
private int lives(int[][] board, int i, int j, int m, int n) {
int lives = 0;
for (int r = Math.max(0, i - 1); r <= Math.min(m - 1, i + 1); r++) {
for (int c = Math.max(0, j - 1); c <= Math.min(n - 1, j + 1); c++) {
lives += board[r][c] & 1;
}
}
lives -= board[i][j] & 1;
return lives;
}
}