正向思路是对每个1进行BFS搜索,这样时间复杂度较高,采用逆向思路,从多源0开始搜索,找到1。然后跟新距离
const int dx[] = {0, 1, -1, 0};
const int dy[] = {1, 0, 0, -1};
class Solution {
public:
// 朴素算法,从每个1出发做一次BFS搜索
// 多源优化,从0开始向1作多源最短路
vector<vector<int>> updateMatrix(vector<vector<int>>& matrix) {
int n = matrix.size(), m = matrix[0].size();
vector<vector<int>> res(n, vector<int>(m, -1));
queue<pair<int, int>> q;
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
if(matrix[i][j] == 0){
res[i][j] = 0;
q.push({i, j});
}
}
}
while(!q.empty()){
auto [x, y] = q.front();
q.pop();
for(int i = 0; i < 4; i++){
int a = x + dx[i];
int b = y + dy[i];
if(a >= 0 && a < n && b >= 0 && b < m && res[a][b] == -1){
res[a][b] = res[x][y] + 1;
q.push({a, b});
}
}
}
return res;
}
};