1、https://leetcode-cn.com/problems/01-matrix/
2、给定一个由 0 和 1 组成的矩阵,找出每个元素到最近的 0 的距离。
两个相邻元素间的距离为 1 。
3、
输入:
[[0,0,0],
[0,1,0],
[0,0,0]]
输出:
[[0,0,0],
[0,1,0],
[0,0,0]]
还是queue
while()
{
}
class Solution {
int dir[4][2] = {{-1,0},{1,0},{0,-1},{0,1}};
public:
vector<vector<int>> updateMatrix(vector<vector<int>>& matrix) {
int m = matrix.size();
int n = matrix[0].size();
vector<vector<int>>ans(m,vector<int>(n));
vector<vector<int>>rember(m,vector<int>(n,-1));
queue<pair<int,int>>que;
for(int i = 0; i < m; i++) // 将所有的 0 添加进初始队列中
{
for(int j = 0; j < n; j++)
{
if(matrix[i][j] == 0)
{
que.emplace(i,j);
ans[i][j] = 0;
rember[i][j] = 1;//记忆化
}
}
}
while(!que.empty()) // 广度优先搜索
{
int i = 0;
int j = 0;
i = que.front().first;
j = que.front().second;
que.pop();
for(int d = 0; d < 4; d++)
{
int next_i = i + dir[d][0];
int next_j = j + dir[d][1];
if(next_i >= 0 && next_i < m && next_j >= 0 && next_j < n && rember[next_i][next_j] == -1)
{
ans[next_i][next_j] = ans[i][j] + 1;
que.emplace(next_i,next_j);
rember[next_i][next_j] = 0;
}
}
}
return ans;
}
};