Shortest Path to Get Food

You are starving and you want to eat food as quickly as possible. You want to find the shortest path to arrive at any food cell.

You are given an m x n character matrix, grid, of these different types of cells:

• '*' is your location. There is exactly one '*' cell.
• '#' is a food cell. There may be multiple food cells.
• 'O' is free space, and you can travel through these cells.
• 'X' is an obstacle, and you cannot travel through these cells.

You can travel to any adjacent cell north, east, south, or west of your current location if there is not an obstacle.

Return the length of the shortest path for you to reach any food cell. If there is no path for you to reach food, return -1.

Example 1:

Input: grid = [["X","X","X","X","X","X"],["X","*","O","O","O","X"],["X","O","O","#","O","X"],["X","X","X","X","X","X"]]
Output: 3
Explanation: It takes 3 steps to reach the food.

思路：就是一个BFS，注意下一层只用!= ‘X’即可 ；

class Solution {
    class Node {
        public int x;
        public int y;
        public Node(int x, int y) {
            this.x = x;
            this.y = y;
        }
    }
    
    public int getFood(char[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        boolean[][] visited = new boolean[m][n];
        Queue<Node> queue = new LinkedList<>();
        for(int i = 0; i < m; i++) {
            for(int j = 0; j < n; j++) {
                if(grid[i][j] == '*') {
                    queue.offer(new Node(i, j));
                    visited[i][j] = true;
                }
            }
        }
        
        int[][] dirs = new int[][] {{0,1},{0,-1},{-1,0},{1,0}};
        int step = 0;
        boolean find = false;
        while(!queue.isEmpty()) {
            int size = queue.size();
            for(int i = 0; i < size; i++) {
                Node node = queue.poll();
                if(grid[node.x][node.y] == '#') {
                    find = true;
                    return step;
                    
                }
                for(int[] dir: dirs) {
                    int nx = node.x + dir[0];
                    int ny = node.y + dir[1];
                    if(0 <= nx && nx < m && 0 <= ny && ny < n 
                       && !visited[nx][ny] && grid[nx][ny] != 'X') {
                        queue.offer(new Node(nx, ny));
                        visited[nx][ny] = true;
                    }
                }
            }
            step++;
        }
        return find ? step : -1;
    }
}