You are given row x col
grid
representing a map where grid[i][j] = 1
represents land and grid[i][j] = 0
represents water.
Grid cells are connected horizontally/vertically (not diagonally). The grid
is completely surrounded by water, and there is exactly one island (i.e., one or more connected land cells).
The island doesn't have "lakes", meaning the water inside isn't connected to the water around the island. One cell is a square with side length 1. The grid is rectangular, width and height don't exceed 100. Determine the perimeter of the island.
Example 1:
Input: grid = [[0,1,0,0],[1,1,1,0],[0,1,0,0],[1,1,0,0]]
Output: 16
Explanation: The perimeter is the 16 yellow stripes in the image above.
Example 2:
Input: grid = [[1]]
Output: 4
Example 3:
Input: grid = [[1,0]]
Output: 4
Constraints:
-
row == grid.length
-
col == grid[i].length
-
1 <= row, col <= 100
-
grid[i][j]
is0
or1
. - There is exactly one island in
grid
.
SOLUTION:
class Solution:
def isEmpty(self, grid, i, j, m, n):
if i < 0 or j < 0 or i >= m or j >= n:
return True
if grid[i][j] == 1:
return False
return True
def islandPerimeter(self, grid: List[List[int]]) -> int:
m = len(grid)
n = len(grid[0])
perimeter = 0
for i in range(m):
for j in range(n):
if grid[i][j] == 1:
for x, y in [(i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1)]:
if self.isEmpty(grid, x, y, m, n):
perimeter += 1
return perimeter
Top comments (0)