Leetcode 994. 腐烂的橘子(bfs解法)(不使用队列和使用队列)

不使用队列:

class Solution {
public:
    int orangesRotting(vector<vector<int>>& grid){
        int move[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
        vector<int> x;
        vector<int> y;
        int book[grid.size()][grid[0].size()];
        memset(book,0,sizeof(book));
        int minute = 0;
        int p = 0;
        while(1){
            int flag = 0;
            //记录下每一次新的腐烂的橘子的位置
            for(int i = 0;i < grid.size();i++){
                for(int j = 0;j < grid[0].size();j++){
                    if(grid[i][j] == 2 && book[i][j] == 0){
                        book[i][j] = 1;
                        x.push_back(i);
                        y.push_back(j);
                        flag++;
                    }
                }
            }
            //如果没有新的腐烂的橘子，退出循环
            if(flag == 0){
                break;
            }
            //以新的腐烂的橘子味中心，继续向上下左右腐烂其他的橘子
            for(int i = p;i < x.size();i++){
                for(int j = 0;j < 4;j++){
                    int xx = x[i] + move[j][0];
                    int yy = y[i] + move[j][1];
                    if(xx < 0 || yy <0 || xx == grid.size() || yy == grid[0].size()){
                        continue;
                    }
                    if(grid[xx][yy] == 0) continue;
                    grid[xx][yy] = 2;
                }
            }
            //记录下p的值，节省下次循环的时间
            p = x.size();
            //时间加一
            minute++;
        } 
        //还有没腐烂的橘子，返回-1                  
        for(int i = 0;i < grid.size();i++){
            for(int j = 0;j < grid[0].size();j++){
                if(grid[i][j] == 1){
                    return -1;
                }
            }
        }
 //等于1是会出现grid=【【0,2】】的情况，等于0是会出现grid=【【0】】的情况
        if(minute == 1 || minute == 0) return 0;
        //因为第一次就已经minute++了，所以结果减一
        return minute-1;
    }
};

使用队列

class Solution {
public:
    int n,m;
    int move[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};
    int orangesRotting(vector<vector<int>>& grid){
        queue<pair<int,int>> que;
        int ans = 0;
        n = grid.size(),m = grid[0].size();
        for(int i = 0;i < n;i++){
            for(int j = 0;j < m;j++){
                if(grid[i][j] == 2) que.push({i,j});
            }
        }
        while(!que.empty()){
            auto q = que.front();
            int x = q.first;
            int y = q.second;
            ans = grid[x][y]-2;
            que.pop();
            for(int i = 0;i < 4;i++){
                int xa = x + move[i][0];
                int ya = y + move[i][1];
                if(xa < 0 || ya < 0 || xa == n || ya == m) continue;
                if(grid[xa][ya] >= 2 || grid[xa][ya] == 0) continue;
                grid[xa][ya] = grid[x][y] + 1; 
                que.push({xa,ya});
            }
        }
        for(int i = 0;i < n;i++){
            for(int j = 0;j < m;j++){
                if(grid[i][j] == 1) return -1;
            }
        }
        return ans;
    }
};