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