463. Island Perimeter

463. Island Perimeter

You are given a map in form of a two-dimensional integer grid where 1 represents land and 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" (water inside that 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:

[[0,1,0,0],
 [1,1,1,0],
 [0,1,0,0],
 [1,1,0,0]]

Answer: 16
Explanation: The perimeter is the 16 yellow stripes in the image below:

 

 

解决方法就是简单的遍历多维数组，当前为1时 查看上下左右是否可以计算为边即可

class Solution(object):

    def islandPerimeter(self, grid):

        """

        :type grid: List[List[int]]

        :rtype: int

        """

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

        icount = 0

        for i in range(m):

            for j in range(n):

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

                    #left

                    if j==0 or (j>0 and grid[i][j-1] == 0):

                        icount+=1

                    #right

                    if j==n-1 or (j<n-1 and grid[i][j+1] == 0):

                        icount+=1

                    #up

                    if i==0 or (i>0 and grid[i-1][j]==0):

                        icount+=1

                    #down

                    if i==m-1 or (i<m-1 and grid[i+1][j]==0):

                        icount+=1

        return icount

 

转载于:https://my.oschina.net/tasker/blog/818865