# [LeetCode]#463. Island Perimeter

**Environment: Python 3.8**

**Key technique: for, math**

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

**Analysis:**

- Find land (1).
- Find neighbor (<->).
- Return 4 * land -2 * neightbor.

**Solution:**

`class Solution:`

def islandPerimeter(self, grid):

m,n=len(grid), len(grid[0])

land, nei=0,0

for i in range(m):

for j in range(n):

if grid[i][j]==1:

land+=1

if i < m-1 and grid[i+1][j]==1:

nei+=1

if j < n-1 and grid[i][j+1]==1:

nei+=1

return land*4-2*nei

**Submissions:**

**Reference:**