問題
Each cell is alive (1) or dead (0) and has up to 8 neighbors. In the next generation a live cell survives with 2 or 3 live neighbors, and a dead cell becomes alive with exactly 3. Cells outside the grid are dead. All cells update at the same time.
Implement next_generation(grid).
Input
grid: A rectangular grid of 0s and 1s.
Output
Return the next generation.
制約
0 ≤ rows, columns ≤ 200
例
例 1
入力：
grid = [
[0, 1, 0],
[0, 1, 0],
[0, 1, 0]
]
期待される出力：
expected = [
[0, 0, 0],
[1, 1, 1],
[0, 0, 0]
]入力：
std::vector<std::vector<long long>> grid = {
{0, 1, 0},
{0, 1, 0},
{0, 1, 0}
};
期待される出力：
std::vector<std::vector<long long>> expected = {
{0, 0, 0},
{1, 1, 1},
{0, 0, 0}
};入力：
long[][] grid = new long[][] {
new long[] {0, 1, 0},
new long[] {0, 1, 0},
new long[] {0, 1, 0}
};
期待される出力：
long[][] expected = new long[][] {
new long[] {0, 0, 0},
new long[] {1, 1, 1},
new long[] {0, 0, 0}
};解説
The vertical "blinker" turns horizontal: the center survives and its left and right neighbors are born, filling the middle row.
例 2
入力：
grid = [
[1, 1],
[1, 1]
]
期待される出力：
expected = [
[1, 1],
[1, 1]
]入力：
std::vector<std::vector<long long>> grid = {
{1, 1},
{1, 1}
};
期待される出力：
std::vector<std::vector<long long>> expected = {
{1, 1},
{1, 1}
};入力：
long[][] grid = new long[][] {
new long[] {1, 1},
new long[] {1, 1}
};
期待される出力：
long[][] expected = new long[][] {
new long[] {1, 1},
new long[] {1, 1}
};解説
Every cell of the 2×2 block has 3 neighbors, so the block stays the same.
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。