Problème
The grid holds 1 for land and 0 for water. Land cells that touch up, down, left or right belong to the same island. Count the islands; a recursive flood fill is a natural approach.
Implement count_islands(grid).
Input
grid: A rectangular grid of 0s and 1s.
Output
Return the number of islands.
Contraintes
0 ≤ rows, columns ≤ 100
Exemples
Exemple 1
Entrée :
grid = [
[1, 1, 0, 0],
[0, 1, 0, 1],
[0, 0, 0, 1]
]
Sortie attendue :
expected = 2Entrée :
std::vector<std::vector<long long>> grid = {
{1, 1, 0, 0},
{0, 1, 0, 1},
{0, 0, 0, 1}
};
Sortie attendue :
long long expected = 2;Entrée :
long[][] grid = new long[][] {
new long[] {1, 1, 0, 0},
new long[] {0, 1, 0, 1},
new long[] {0, 0, 0, 1}
};
Sortie attendue :
long expected = 2;Explication
The top-left group of 3 cells is one island; the two 1s on the right form a second: 2.
Exemple 2
Entrée :
grid = [
[1, 0, 1],
[0, 1, 0]
]
Sortie attendue :
expected = 3Entrée :
std::vector<std::vector<long long>> grid = {
{1, 0, 1},
{0, 1, 0}
};
Sortie attendue :
long long expected = 3;Entrée :
long[][] grid = new long[][] {
new long[] {1, 0, 1},
new long[] {0, 1, 0}
};
Sortie attendue :
long expected = 3;Explication
Diagonal neighbors don't connect, so each 1 is its own island: 3.
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.