【刷leetcode，拿Offer-038】1030. Matrix Cells in Distance Order

题目链接：https://leetcode.com/problems/matrix-cells-in-distance-order/

题面：

1030. Matrix Cells in Distance Order

Easy

7240FavoriteShare

We are given a matrix with R rows and C columns has cells with integer coordinates (r, c), where 0 <= r < R and 0 <= c < C.

Additionally, we are given a cell in that matrix with coordinates (r0, c0).

Return the coordinates of all cells in the matrix, sorted by their distance from (r0, c0) from smallest distance to largest distance.  Here, the distance between two cells (r1, c1) and (r2, c2) is the Manhattan distance, |r1 - r2| + |c1 - c2|.  (You may return the answer in any order that satisfies this condition.)

 

Example 1:

Input: R = 1, C = 2, r0 = 0, c0 = 0
Output: [[0,0],[0,1]]
Explanation: The distances from (r0, c0) to other cells are: [0,1]

Example 2:

Input: R = 2, C = 2, r0 = 0, c0 = 1
Output: [[0,1],[0,0],[1,1],[1,0]]
Explanation: The distances from (r0, c0) to other cells are: [0,1,1,2]
The answer [[0,1],[1,1],[0,0],[1,0]] would also be accepted as correct.

Example 3:

Input: R = 2, C = 3, r0 = 1, c0 = 2
Output: [[1,2],[0,2],[1,1],[0,1],[1,0],[0,0]]
Explanation: The distances from (r0, c0) to other cells are: [0,1,1,2,2,3]
There are other answers that would also be accepted as correct, such as [[1,2],[1,1],[0,2],[1,0],[0,1],[0,0]].

 

Note:

1. 1 <= R <= 100
2. 1 <= C <= 100
3. 0 <= r0 < R
4. 0 <= c0 < C

题意：给出一个0 1矩阵中，每个位置到0的最短距离。

解题：

求最短距离，用vis数组+bfs即可。其中vis数组可以用hash进行压缩存储。

代码：

class Solution {
public:
    vector<vector<int>> allCellsDistOrder(int R, int C, int r0, int c0) {
        queue <int> q1,q2;
        vector <vector<int>> res;
        map <int,int> vis;
        int dirx[4]={0,1,-1,0};
        int diry[4]={1,0,0,-1};
        q1.push(r0);
        q2.push(c0);
        int cx,cy,tx,ty;
        vector <int> tmp;
        tmp.push_back(r0);
        tmp.push_back(c0);
        res.push_back(tmp);
        vis[r0*C+c0]=1;
        while(!q1.empty()){
           cx=q1.front();
           cy=q2.front();
           q1.pop();q2.pop();
           for(int i=0;i<4;i++){
               tx=cx+dirx[i];
               ty=cy+diry[i];
               if(tx>=0&&ty>=0&&tx<R&&ty<C&&vis[tx*C+ty]==0){
                   vector <int> tt;
                   tt.push_back(tx);
                   tt.push_back(ty);
                   q1.push(tx);
                   q2.push(ty);
                   res.push_back(tt);
                   vis[tx*C+ty]=1;
               }
           }
        }
        return res;
    }
};