Problem
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.
Einschränkungen
0 ≤ rows, columns ≤ 200
Beispiele
Eingabe:
grid = [
[0, 1, 0],
[0, 1, 0],
[0, 1, 0]
]
Erwartete Ausgabe:
expected = [
[0, 0, 0],
[1, 1, 1],
[0, 0, 0]
]Eingabe:
std::vector<std::vector<long long>> grid = {
{0, 1, 0},
{0, 1, 0},
{0, 1, 0}
};
Erwartete Ausgabe:
std::vector<std::vector<long long>> expected = {
{0, 0, 0},
{1, 1, 1},
{0, 0, 0}
};Eingabe:
long[][] grid = new long[][] {
new long[] {0, 1, 0},
new long[] {0, 1, 0},
new long[] {0, 1, 0}
};
Erwartete Ausgabe:
long[][] expected = new long[][] {
new long[] {0, 0, 0},
new long[] {1, 1, 1},
new long[] {0, 0, 0}
};Erläuterung
The vertical "blinker" turns horizontal: the center survives and its left and right neighbors are born, filling the middle row.
Eingabe:
grid = [
[1, 1],
[1, 1]
]
Erwartete Ausgabe:
expected = [
[1, 1],
[1, 1]
]Eingabe:
std::vector<std::vector<long long>> grid = {
{1, 1},
{1, 1}
};
Erwartete Ausgabe:
std::vector<std::vector<long long>> expected = {
{1, 1},
{1, 1}
};Eingabe:
long[][] grid = new long[][] {
new long[] {1, 1},
new long[] {1, 1}
};
Erwartete Ausgabe:
long[][] expected = new long[][] {
new long[] {1, 1},
new long[] {1, 1}
};Erläuterung
Every cell of the 2×2 block has 3 neighbors, so the block stays the same.
So gehst du vor
Versuch es zuerst allein und öffne dann einen Hinweis nach dem anderen.
Hinweis 1
Every cell changes simultaneously, so the next state must be computed from the original grid, not from partially updated values.
Hinweis 2
Count live neighbors for each cell and apply the survival and birth rules to build a new grid.
Hinweis 3
Edge cells need outside-the-grid neighbors treated as dead, and a cell's own state should not count as a neighbor.
Erwartete Komplexität
O(rows × columns) time, O(rows × columns) extra space
Referenzen
Diese Aufgabe wurde für CodeUtility angepasst. Beachte die oben genannten Vorgaben und Einschränkungen.