- 问题:
二维数组的岛屿问题:
由1和0组成的二维数组,1代表陆地,0代表水域,由水域围成的陆地即为岛屿.
数组周围默认为水域
例如:
1 1 1 1 0 1
0 1 1 0 1 1
1 1 0 0 0 0
0 0 0 1 0 0
输出:3
0 1 0 1
1 1 0 1
0 0 0 0
输出:2
- 代码:
def numIsLands(grid):
rows,cols = len(grid),len(grid[0])
count = 0 #统计岛屿
for row in range(rows):
for col in range(cols):
if grid[row][col] == 1:#发现陆地
count += 1 #结果+1
grid[row][col] = 0#将其转为0,代表已经访问过
#对发现的陆地进行扩张,即执行BFS,将与其相邻的陆地都标记为已经访问
#调用经典的BFS模板
land_positions = collections.deque()
land_positions.append([row,col]) # 将需要检测周边元素的坐标传入队列
while len(land_positions) > 0 :
x,y = land_positions.popleft()
all_sides = [[0,-1],[0,1],[1,0],[-1,0]]
for dx,dy in all_sides:#进行四个方向的扩张
newx,newy = x+dx,y+dy
#判断有效性
if 0 <= newx < len(grid) and 0 <= newy < len(grid[0]) and grid[newx][newy] == 1:
grid[newx][newy] = 0 #因为可由BFS访问到,代表属于同一块岛屿,将其置为0,代表已经访问
land_positions.append([newx,newy])
return count
if __name__ == "__main__":
import collections
grid = [[1,1,1,1,0,1],[0,1,1,0,1,1],[1,1,0,0,0,0],[0,0,0,1,0,0]]
result = numIsLands(grid)
print(result)