LeetCode542. 01 Matrix（多源最短路径，BFS）

原题

Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.The distance between two adjacent cells is 1.
Note:
The number of elements of the given matrix will not exceed 10,000.
There are at least one 0 in the given matrix.
The cells are adjacent in only four directions: up, down, left and right.

题意

就是输出每个1与最近的0的路径。与之前Leetcode1162有相似之处，首先将所有0的源点看做超级源点，即转换为单源最短距离问题。常见解决思路就是BFS了。代码如下：

代码

class Solution {
public:
    vector<vector<int>> updateMatrix(vector<vector<int>>& matrix) {
        vector<vector<bool>> visited(matrix.size(),vector<bool>(matrix[0].size()));
        vector<vector<int>> result(matrix.size(),vector<int>(matrix[0].size()));
        queue<pair<int,int>> qu;
        for(int i=0;i<matrix.size();i++){
            for(int j=0;j<matrix[0].size();j++){
                if(matrix[i][j]==0){
                    qu.emplace(i,j);
                    visited[i][j]=true;
                }
            }
        }
        int dx[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
        while(!qu.empty()){
            auto tmp = qu.front();
            qu.pop();
            for(int i=0;i<4;i++){
                int nx=dx[i][0]+tmp.first;
                int ny=dx[i][1]+tmp.second;
                if(nx>=0&&ny>=0&&nx<matrix.size()&&ny<matrix[0].size()&&!visited[nx][ny]){
                    qu.emplace(nx,ny);
                    result[nx][ny]=result[tmp.first][tmp.second]+1;
                    visited[nx][ny]=true;
                }
            }
        }
        return result;
    }
};