Given an m×n binary grid, find the maximum area (number of cells) of a 4-directionally connected component of 1s (an island), returning 0 if none exist. This is a standard grid connected-components / flood-fill problem (solvable with DFS/BFS/Union-Find) with m,n ≤ 50.
Use esses exemplos para entender em que contexto ela costuma cair e adaptar sua prática.
You are given an m x n binary matrix grid. An island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water. The area of an island is the number of cells with a value 1 in the island. Return the maximum area of an island in grid. If there is no island, return 0.
Sem observação adicional neste relato público.
Find the max area of an island with a given starting point and obstacles that cannot be passed
Nenhum anexo público associado a esta pergunta.
No app você encontra perguntas parecidas, compara empresas e aprofunda essa busca com mais filtros.
Amazon