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. 写一个子函数,记录每一块岛屿有多少边
1. 遍历整个grid,将岛屿的边加起来

class Solution(object):
    def islandPerimeter(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        n=len(grid)
        m=len(grid[0])
        ans=0
        for i in range(n):
            for j in range(m):
                if grid[i][j]:
                    ans+=self.countisland(grid,i,j)
        return ans

    def countisland(self,grid,i,j):
        a=[[i-1,j],[i+1,j],[i,j-1],[i,j+1]]
        n=len(grid)
        m=len(grid[0])
        count=0 #记录1的个数
        for x in a:
            if x[0]>-1 and x[0]<n and x[1]>-1 and x[1]<m:
                if grid[x[0]][x[1]]:
                    count+=1
        return 4-count

更改,把代码写短:

class Solution(object):
    def islandPerimeter(self, grid):
        """
        :type grid: List[List[int]]
        :rtype: int
        """
        n=len(grid)
        m=len(grid[0])
        def countisland(i,j):
            a=[[i-1,j],[i+1,j],[i,j-1],[i,j+1]]
            count=0 #记录1的个数
            for x in a:
                if x[0]>-1 and x[0]<n and x[1]>-1 and x[1]<m:
                    if grid[x[0]][x[1]]:
                        count+=1
            return 4-count

        return sum(countisland(i,j) for i in xrange(n) for j in xrange(m) if grid[i][j])

蓦然回岁,tag里面的hash table 还是没有用到~~sad

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值