计算矩阵中距离1最近的0的距离,选择超级零作为起点 ,将第一批零作为第一层,加入队列,依次遍历。
//计算多源最短路径
public static int[][] updateMatrix(int[][] mat) {
int n = mat.length;
int m = mat[0].length;
int dist[][] = new int[n][m];
boolean visit[][] = new boolean[n][m];
Queue<int[]> queue = new LinkedList<>();
int dx[] = new int[]{0, 0, -1, 1};
int dy[] = new int[]{-1, 1, 0, 0};
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (mat[i][j] == 0) {
queue.offer(new int[]{i, j});
visit[i][j] = true;
}
}
}
while (queue.size() > 0) {
int p[] = queue.poll();
for (int j = 0; j < 4; j++) {
int x = dx[j] + p[0];
int y = dy[j] + p[1];
if (x < 0 || x >= n || y < 0 || y >= m || visit[x][y]) continue;
queue.offer(new int[]{x, y});
visit[x][y] = true;
dist[x][y] = dist[p[0]][p[1]] + 1;
}
}
return dist;
}