Done BFS Livecode

src/Search.java

@@ -1,5 +1,10 @@
-public class Search {
-     /**
+    import java.util.ArrayList;
+    import java.util.LinkedList;
+    import java.util.List;
+    import java.util.Queue;
+
+    public class Search {
+    /**
      * Finds the location of the nearest reachable cheese from the rat's position.
      * Returns a 2-element int array: [row, col] of the closest 'c'. If there are multiple
      * cheeses that are tied for the same shortest distance to reach, return
@@ -28,7 +33,92 @@ public class Search {
      * @throws CrowdedMazeException if there is more than one rat in the maze
      * @throws HungryRatException if there is no reachable cheese
      */
-    public static int[] nearestCheese(char[][] maze) throws EscapedRatException, CrowdedMazeException, HungryRatException {
-        return null;
+   public static int[] nearestCheese(char[][] maze) throws EscapedRatException, CrowdedMazeException, HungryRatException {
+        boolean[][] visited = new boolean[maze.length][maze[0].length];
+
+        int[] start = ratLocation(maze);
+
+        // queue = []
+        Queue<int[]> queue = new LinkedList<>();
+
+        // queue.add(start)
+        queue.add(start);
+
+        // while queue not empty
+        while (!queue.isEmpty()) {
+            //   current = queue.pop
+            int[] current = queue.poll();
+
+            int curR = current[0];
+            int curC = current[1];
+
+            //   if visited: continue
+            if (visited[curR][curC]) continue;
+
+            //   mark that it is visited
+            visited[curR][curC] = true;
+
+            //   check if cheese: return current
+            if (maze[curR][curC] == 'c') return current;
+
+            //   add neighbors to the queue
+            queue.addAll(getNeighbors(maze, current));
+        }
+
+        // throw hungry rat exception
+        throw new HungryRatException();
     }
+
+    public static List<int[]> getNeighbors(char[][] maze, int[] current) {
+        int curR = current[0];
+        int curC = current[1];
+
+        int[][] directions = {
+            {-1, 0}, //up
+            {1, 0}, //down
+            {0, -1}, //left
+            {0, 1} //right
+        };
+
+        List<int[]> possibleMoves = new ArrayList<>();
+
+        for (int[] direction : directions) {
+            int changeR = direction[0];
+            int changeC = direction[1];
+
+            int newR = curR + changeR;
+            int newC = curC + changeC;
+
+            if (newR >= 0 && newR < maze.length &&
+                newC >= 0 && newC < maze[newR].length &&
+                maze[newR][newC] != 'w') {
+                // valid move
+                int[] validMove = {newR, newC};
+                possibleMoves.add(validMove);
+            }
+        }
+
+        return possibleMoves;
+    }
+
+    public static int[] ratLocation(char[][] maze) throws EscapedRatException, CrowdedMazeException {
+        int[] location = null;
+
+        // searching
+        for (int r = 0; r < maze.length; r++) {
+            for (int c = 0; c < maze[r].length; c++) {
+                if (maze[r][c] == 'R') {
+                    if (location != null) throw new CrowdedMazeException();
+
+                    location = new int[]{r, c};
+                }
+            }
+        }
+        // 404 rat not found
+        if (location == null) throw new EscapedRatException();
+
+        return location;
+    }
+
+    public static void main(String[] args) {}
 }