leetcode：994. 腐烂的橘子（bfs）

链接：https://leetcode-cn.com/problems/rotting-oranges/
遍历原数组，将所有腐烂的橘子放入到队列中，最后再一起bfs。
java代码：

class Solution {
    public int orangesRotting(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        int maxtime = m*n;                
        int [][] mintime = new int [m][n];
        for(int i = 0;i<m;i++)
            for(int j = 0;j<n;j++)
                if(grid[i][j] == 1)
                    mintime[i][j] = maxtime;
        int [][]visited = new int [m][n];//存储是否已访问过
        Queue<Integer> q = new LinkedList();//存储坐标信息
        Queue<Integer>level = new LinkedList();//存储多少时间后会腐烂
        int di[] = {1,0,-1,0};
        int dj[] = {0,1,0,-1};
        for(int i = 0;i<m;i++)
            for(int j = 0;j<n;j++)
            {
                if(grid[i][j] == 2) //将所有腐烂的橘子加入队列
                {
                    q.add(i*n+j);
                    visited[i][j] = 1;
                    level.add(0);
                }
            }
        while(!q.isEmpty())//bfs
        {
            int temp = q.remove();
            int tempi = temp/n;
            int tempj = temp%n;
            int templevel = level.remove();
            mintime[tempi][tempj] = Math.min(mintime[tempi][tempj],templevel);
            for(int k = 0;k<4;k++)
            {
                int ii = tempi+di[k];
                int jj = tempj+dj[k];
                if(ii>=0&&ii<m&&jj>=0&&jj<n&&grid[ii][jj]==1&&visited[ii][jj] ==0)
                {
                    q.add(ii*n+jj);
                    level.add(templevel+1);
                    visited[ii][jj] = 1;
                }
            }
        }
        int ans = 0;
        for(int i = 0;i<m;i++)//寻找最大值
            for(int j = 0;j<n;j++)
                if(grid[i][j] == 1)
                {
                    if(mintime[i][j] == maxtime)
                        return -1;
                    else 
                        ans = Math.max(ans,mintime[i][j]);
                }
        return ans;

    }
}