LeetCode--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:

1. The number of elements of the given matrix will not exceed 10,000.
2. There are at least one 0 in the given matrix.
3. The cells are adjacent in only four directions: up, down, left and right.

解读：给予一个01矩阵，求各个点到最近的0的距离，每走一格为一步。结果以同等规模的举证来表示。

思路：是一个距离题目，采用BFS来解题。初始先把每个0的坐标入队列，把1的点的距离设置为无穷大。循环：从队列取出一个坐标，判断周围四个点（若不越界）的距离是否大于所取坐标的距离，若大于则修改周围点的距离并将坐标入队，否则不更改也不入队。

代码：

class Solution {
public:
    vector<vector<int>> updateMatrix(vector<vector<int>>& matrix) {
        queue<pair<int, int>> q;
        int a = matrix.size(), b = matrix[0].size();
        for (int i = 0; i < a; ++i) {
            for (int j = 0; j < b; ++j) {
                if (matrix[i][j] == 0) q.push({i, j});
                else matrix[i][j] = INT_MAX;
            }
        }
        while(!q.empty()){
            auto p = q.front();
            q.pop();
           for(int i =0; i < 4; i++){
                int k, m;
                if(i == 0) {
                     k = p.first-1;
                     m = p.second;
                }
                if(i == 1) {
                    k = p.first+1;
                    m=p.second;
                }
                if(i == 2){
                    k = p.first;
                    m = p.second-1;
                }
                if(i == 3) {
                    k = p.first;
                    m = p.second+1;
                }
           
                 if (k < 0 || k >= a || m < 0 || m >= b ||
                matrix[k][m] <= matrix[p.first][p.second]) continue;
                matrix[k][m] = matrix[p.first][p.second] + 1;
                q.push({k, m});
            }
            
        }
        return matrix;
    }
};