LeetCode 542. 01 Matrix

542. 01 Matrix

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.
Example 1:
Input:

0 0 0
0 1 0
0 0 0
Output:
0 0 0
0 1 0
0 0 0
Example 2:
Input:

0 0 0
0 1 0
1 1 1
Output:
0 0 0
0 1 0
1 2 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.

Approach

题目大意：给你01矩阵，然后要计算每个点距离0的最短距离为多少，返回一个矩阵
思路方法：看完题意很容易就枚举每个1的点BFS计算距离0的点为多少，然后肯定超时，这题同样也是要反向求解（417. Pacific Atlantic Water Flow 类似的方法），将矩阵中为0的点距离为0，其他均为INT_MAX，然后将为零的点放入队列中，然后BFS，更新每个点的距离

Code

class Solution {
public:
    vector<vector<int>> updateMatrix(vector<vector<int>>& matrix) {
        int high = matrix.size();
        int len = matrix[0].size();
        vector<vector<int>>dis(high, vector<int>(len,INT_MAX));
        queue<pair<int, int>>q;
        for (int i = 0; i < high; i++) {
            for (int j = 0; j < len; j++) {
                if (matrix[i][j] == 0) {
                    dis[i][j] = 0;
                    q.push(make_pair(i, j));
                }
            }
        }
        vector<vector<int>> dir{ {0,0,1,-1},{1,-1,0,0} };
        while (!q.empty()) {
            pair<int, int> coordinate = q.front();
            q.pop();
            int x = coordinate.first;
            int y = coordinate.second;
            for (int i = 0; i < 4; i++) {
                int newx = x + dir[0][i];
                int newy = y + dir[1][i];
                if (newx < 0 || newy < 0 || newx >= high || newy >= len) continue;
                if (dis[newx][newy] > dis[x][y] + 1) {//更新距离
                    dis[newx][newy] = dis[x][y] + 1;
                    q.push(make_pair(newx, newy));
                }
            }
        }
        return dis;
    }
};