994力扣：腐烂的橘子

class Solution {
public:
    int orangesRotting(vector<vector<int>>& grid) {
        int row=grid.size();
        int col=grid[0].size();
        queue<pair<int,int>> q;
        for(int i=0;i<row;i++){
            for(int j=0;j<col;j++){
                if(grid[i][j]==2){
                    q.push({i,j});
                }
            }
        }
        int time=0;
        while(!q.empty()){
            int n=q.size();
            for(int i=1;i<=n;i++){
                auto tmp=q.front();
                q.pop();
                if(tmp.first-1>=0 && grid[tmp.first-1][tmp.second]==1)
                {q.push({tmp.first-1,tmp.second});grid[tmp.first-1][tmp.second]=2;}

                if(tmp.first+1<=row-1 && grid[tmp.first+1][tmp.second]==1)
                {q.push({tmp.first+1,tmp.second});grid[tmp.first+1][tmp.second]=2;}

                if(tmp.second-1>=0 && grid[tmp.first][tmp.second-1]==1)
                {q.push({tmp.first,tmp.second-1});grid[tmp.first][tmp.second-1]=2;}

                if(tmp.second+1<=col-1 && grid[tmp.first][tmp.second+1]==1)
                {q.push({tmp.first,tmp.second+1});grid[tmp.first][tmp.second+1]=2;}
            }
            if(!q.empty()) time++;
        }
        for(int i=0;i<row;i++){
            for(int j=0;j<col;j++){
                if(grid[i][j]==1){
                    return -1;
                }
            }
        }
        return time;

    }
};

bfs、队列里面放数对