LeetCode 994 腐烂的橘子

题目链接

bfs（广度优先遍历），这道题跟leetcode200很像，可以参考下它的bfs方法

class Solution {

    int[] dx = {0, 0, 1, -1};
    int[] dy = {1, -1, 0, 0};

    public int orangesRotting(int[][] grid) {
        if(grid == null || grid.length == 0 || grid[0].length == 0 ) {
            return 0;
        }
        
        int count = 0;
        int m = grid.length, n = grid[0].length;
        LinkedList<Integer> linkedList = new LinkedList<>();

        for(int i = 0; i < m; i++) {
            for(int j = 0; j < n; j++) {
                if(grid[i][j] == 1) {
                    count++;
                } else if (grid[i][j] == 2) {
                    linkedList.add(i * n + j);
                }
            }
        }

        //腐烂的轮数，或者分钟数
        int round = 0;
        while(count > 0 && !linkedList.isEmpty()) {
            round++;
            int sz = linkedList.size();
            while(sz > 0) {
                int node = linkedList.removeFirst();
                int nodeX = node / n;
                int nodeY = node % n;
                for(int k = 0; k < 4; k++) {
                    int newX = nodeX + dx[k];
                    int newY = nodeY + dy[k];
                    if(newX >= 0 && newX < m && newY >= 0 && newY < n && grid[newX][newY] == 1) {
                        grid[newX][newY] = 2;
                        count--;
                        linkedList.add(newX * n + newY);
                    }
                }
                sz--;
            }
        }

        if(count > 0) {
            return -1;
        } else {
            return round;
        }
    }
}

这道题在学习了bfs后就很好理解了，可以参考leetcode本题的题解和200的题解进行比对、总结。