You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.
package class34 ;
// 有关这个游戏更有意思、更完整的内容：
// https://www.bilibili.com/video/BV1rJ411n7ri
// 也推荐这个up主
public class Problem_0289_GameOfLife {
public static void gameOfLife ( int [ ] [ ] board ) {
int N = board . length ;
int M = board [ 0 ] . length ;
for ( int i = 0 ; i < N ; i + + ) {
for ( int j = 0 ; j < M ; j + + ) {
int neighbors = neighbors ( board , i , j ) ;
if ( neighbors = = 3 | | ( board [ i ] [ j ] = = 1 & & neighbors = = 2 ) ) {
board [ i ] [ j ] | = 2 ;
}
}
}
for ( int i = 0 ; i < N ; i + + ) {
for ( int j = 0 ; j < M ; j + + ) {
board [ i ] [ j ] > > = 1 ;
}
}
}
// b[i][j] 这个位置的数，
public static int neighbors ( int [ ] [ ] b , int i , int j ) {
return f ( b , i - 1 , j - 1 )
+ f ( b , i - 1 , j )
+ f ( b , i - 1 , j + 1 )
+ f ( b , i , j - 1 )
+ f ( b , i , j + 1 )
+ f ( b , i + 1 , j - 1 )
+ f ( b , i + 1 , j )
+ f ( b , i + 1 , j + 1 ) ;
}
// b[i][j] 上面有1， ， ，
public static int f ( int [ ] [ ] b , int i , int j ) {
return ( i > = 0 & & i < b . length & & j > = 0 & & j < b [ 0 ] . length & & ( b [ i ] [ j ] & 1 ) = = 1 ) ? 1 : 0 ;
}
}
