01矩阵

from collections import deque
class Solution:
    def updateMatrix(self, matrix):
        row = len(matrix)
        col = len(matrix[0])
        res = [[0] * col for _ in range(row)]
        visited = [[False for _ in range(col)]for _ in range(row)]
        detection = [[-1,0],[1,0],[0,1],[0,-1]]

        queue = deque()
        for i in range(row):
            for j in range(col):
                if matrix[i][j] == 0:
                    queue.append((i,j))
                    visited[i][j] = True
        while queue:
            i,j = queue.popleft()
            for index in detection:
                if 0 <= index[0]+i <row and 0 <=index[1]+j <col and visited[index[0]+i][index[1]+j] != True:
                    res[index[0]+i][index[1]+j] = res[i][j] + 1
                    queue.append((index[0]+i,index[1]+j))
                    visited[index[0]+i][index[1]+j] = True
        return res