[python刷题]牛客网6——洪水——BFS方法找矩阵中两点之间的最小距离

题目描述

在一个nxm矩阵形状的城市里爆发了洪水，洪水从(0,0)的格子流到这个城市，在这个矩阵中有的格子有一些建筑，洪水只能在没有建筑的格子流动。请返回洪水流到(n - 1,m - 1)的最早时间(洪水只能从一个格子流到其相邻的格子且洪水单位时间能从一个格子流到相邻格子)。

给定一个矩阵map表示城市，其中map[i][j]表示坐标为(i,j)的格子，值为1代表该格子有建筑，0代表没有建筑。同时给定矩阵的大小n和m(n和m均小于等于100)，请返回流到(n - 1,m - 1)的最早时间。保证洪水一定能流到终点。

from collections import deque #引入双端队列
class Flood:
    def floodFill_bfs(self,tmap,n,m):
        queue = deque()
        queue.append((0,0)) #添加一开始洪水的位置(0,0)
        distance = {} #初始化字典
        distance[(0,0)] = 0 #Out[66]: {(0, 0): 0} 创建字典记录每个格子需要的时间
        self.n = n
        self.m = m
        self.tmap = tmap
        while queue: #当queue不为空时，相当于遍历queue中所有元素
            cur = queue.popleft() #出队列，返回队列的元素
            for next in self.graphNeighbors(cur): #调用类内方法
                if next not in distance:  #存储每一个格子需要的时间
                    queue.append(next)
                    distance[next] = 1 + distance [cur]
        return distance[(n-1,m-1)] #一直到(n-1,m-1)需要的时间
   
    def graphNeighbors(self,point): #构建该点的所有邻居
        i = point[0]
        j = point[1]
        neighbors = [] #列表
        if 0 <= i - 1 < self.n and self.tmap[i - 1][j] == 0:
            neighbors.append((i - 1,j)) #上邻居
        if 0 <= i + 1 < self.n and self.tmap[i + 1][j] == 0:
            neighbors.append((i + 1,j)) #下邻居
        if 0 <= j - 1 < self.m and self.tmap[i][j - 1] == 0:
            neighbors.append((i, j - 1)) #左邻居
        if 0 <= j + 1 < self.m and self.tmap[i][j + 1] == 0:
            neighbors.append((i, j + 1)) #右邻居
        return neighbors #返回该点的邻居列表

#实例
m = Flood() 
#测试用例
m.floodFill_bfs([[0,0,1,0,0,0,0,0,1,1,0,1,0,0,0,0,1,0,1,1,1,0,0,0,0,0,0],
                 [0,1,1,0,1,0,0,1,0,0,0,0,1,0,1,0,0,0,1,0,1,0,1,0,1,1,0],
                 [0,1,1,0,0,0,1,1,1,0,1,0,1,1,0,0,0,1,1,1,1,0,0,1,1,0,1],
                 [0,1,1,1,0,1,1,0,0,0,1,1,1,1,0,1,1,0,1,1,0,1,1,1,0,1,0],
                 [0,1,1,1,1,0,1,0,0,1,0,1,0,0,1,0,1,1,1,0,1,0,0,1,1,1,0],
                 [0,0,1,0,0,0,1,1,0,0,1,1,1,1,1,1,0,1,0,0,0,0,1,0,1,0,0],
                 [0,0,0,1,0,0,0,1,1,0,0,0,1,1,0,0,0,0,1,1,1,1,0,0,0,0,0],
                 [0,1,0,1,0,0,0,0,0,1,1,0,0,1,0,1,1,0,1,1,1,1,1,1,0,0,0],
                 [0,0,0,0,1,0,0,1,0,1,1,0,1,1,0,1,1,1,1,0,0,0,0,0,0,1,1],
                 [0,0,1,1,1,0,1,1,0,1,1,0,0,0,1,1,1,0,0,1,0,1,1,0,0,0,0],
                 [0,1,0,0,1,0,0,1,0,1,1,1,0,0,0,0,1,1,1,0,1,1,0,0,0,1,1],
                 [0,0,0,0,0,0,1,1,1,1,0,1,1,1,0,0,1,1,0,0,1,1,0,1,0,1,1],
                 [0,0,1,1,0,0,0,1,1,1,1,1,1,1,0,1,0,1,0,1,1,0,0,0,1,1,0],
                 [0,1,0,1,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,1,1,1,0,1,0,0],
                 [0,1,0,0,1,1,0,1,0,1,0,1,0,0,1,1,0,0,1,1,0,1,0,1,0,0,1],
                 [0,1,0,1,0,1,0,0,0,0,0,1,0,1,1,1,0,0,1,1,0,1,0,1,1,0,1],
                 [0,0,1,0,0,1,1,1,1,0,0,0,0,1,0,0,0,0,0,0,1,1,1,1,0,1,0],
                 [0,1,1,0,1,1,0,0,0,1,1,1,0,0,1,0,1,1,0,0,1,0,1,1,0,0,0],
                 [0,1,1,0,0,0,0,1,1,0,1,1,1,1,0,1,0,0,1,1,0,1,1,1,1,0,0],
                 [0,0,0,0,1,0,0,1,1,0,1,1,0,0,1,0,0,1,0,0,0,0,1,1,0,0,1],
                 [0,1,0,0,1,0,0,1,1,0,0,1,1,1,1,1,0,1,0,1,0,1,1,0,1,1,1],
                 [0,0,1,1,1,1,0,1,1,1,0,0,0,0,0,1,1,0,0,0,0,1,1,1,1,1,0],
                 [0,1,1,0,1,1,1,1,1,1,0,0,0,1,1,0,1,0,1,1,1,1,0,0,1,0,1],
                 [0,0,1,1,1,0,1,1,0,0,1,1,0,0,0,0,0,0,0,1,0,0,1,1,1,0,1],
                 [0,0,0,0,1,0,1,1,1,1,1,1,1,1,0,0,1,1,1,1,0,0,1,1,0,0,0],
                 [0,1,0,0,0,0,0,1,1,0,1,1,1,0,0,0,0,1,1,0,1,1,0,1,1,0,1],
                 [0,1,1,0,0,1,1,0,0,0,0,1,0,1,1,1,1,1,0,1,0,1,1,0,0,0,1],
                 [0,0,0,1,1,0,0,0,0,1,1,1,1,1,1,0,1,0,0,1,1,1,0,0,1,1,1],
                 [0,0,1,0,0,1,0,0,0,0,1,1,1,1,1,1,0,1,0,0,0,1,1,0,1,1,1],
                 [0,0,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,1,0,1,1,0,0,0,0],
                 [0,0,1,0,0,1,1,0,1,0,0,0,1,1,1,1,1,1,1,1,1,0,0,1,0,1,1],
                 [0,1,0,1,1,1,1,1,1,0,0,1,1,1,0,0,0,0,0,0,1,0,0,0,1,1,1],
                 [0,0,0,1,0,0,1,1,1,0,0,1,0,0,0,0,0,0,1,0,0,1,1,0,0,0,1],
                 [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]],
            34,27)