Completed livecode

src/SalamanderSearch.java

@@ -1,5 +1,7 @@
 import java.util.ArrayList;
+import java.util.HashSet;
 import java.util.List;
+import java.util.Set;
 
 public class SalamanderSearch {
     public static void main(String[] args) {
@@ -18,6 +20,19 @@ public static void main(String[] args) {
             {'f','W','.','.','W','.'},
             {'W','.','W','.','.','.'},
         };
+
+        Set<int[]> coordinates = new HashSet<>();
+
+        int[] coord1 = new int[] {1,5};
+        int[] coord2 = new int[] {3,7};
+        int[] coord3 = new int[] {1,5};
+
+
+        coordinates.add(coord1);
+        coordinates.add(coord2);
+        // coordinates.add(coord3);
+        System.out.println(coordinates.size());
+        System.out.println(coordinates.contains(coord3));
     }
 
     /**
@@ -43,6 +58,103 @@ public static void main(String[] args) {
      * @return whether the salamander can reach the food
      */
     public static boolean canReach(char[][] enclosure) {
-        return false;
+        int[] start = salamanderLocation(enclosure);
+        boolean[][] visited = new boolean[enclosure.length][enclosure[0].length];
+
+        return canReach(enclosure, start, visited);
+    }
+
+    public static boolean canReach(char[][] enclosure, int[] current, boolean[][]visited){
+        int curR = current[0];
+        int curC = current[1];
+
+        //base case
+        if(visited[curR][curC]){
+            return false;
+        }
+
+        if(enclosure[curR][curC] == 'f'){
+            return true;
+        }
+
+        visited[curR][curC] = true;
+
+        List<int[]> moves = possibleMoves(enclosure, current);
+
+        for(int[] move : moves){
+            if(canReach(enclosure, move, visited)){
+                return true;
+            }
+        }
+
+        return false; 
+    }
+
+    public static List<int[]> possibleMoves(char[][] enclosure, int[] current){
+        int curR = current[0];
+        int curC = current[1];
+
+        List<int[]> moves = new ArrayList<>();
+
+        int[][] directions = new int[][] {
+            {-1, 0},
+            {1, 0},
+            {0, -1},
+            {0, 1}
+        };
+
+        for(int[] direction : directions){
+            int newR = curR + direction[0];
+            int newC = curC + direction[1];
+
+            if(newR >= 0 && newR < enclosure.length && newC >= 0 
+            && newC < enclosure[0].length && enclosure[newR][newC] != 'W' ) {
+                moves.add(new int[] {newR, newC});
+            }
+        }
+        // //Up 
+        // int newR = curR - 1;
+        // int newC = curC;
+        // if(newR >= 0 && enclosure[newR][newC] != 'W'){
+        //     moves.add(new int[]{newR, newC});
+        // }
+
+        // //Down
+        // newR = curR + 1;
+        // newC = curC;
+        // if(newR < enclosure.length && enclosure[newR][newC] != 'W'){
+        //     moves.add(new int[]{newR, newC});
+        // }
+
+        // //Left
+        // newR = curR;
+        // newC = curC - 1;
+
+        // if(newC >= 0 && enclosure[newR][newC] != 'W'){
+        //     moves.add(new int[]{newR, newC});
+        // }
+
+        // //Right
+        // newR = curR;
+        // newC = curC + 1;
+
+        // if(newC < enclosure[0].length && enclosure[newR][newC] != 'W'){
+        //     moves.add(new int[]{newR, newC});
+        // }
+
+        return moves;
+    }
+
+    public static int[] salamanderLocation(char[][] enclosure){
+        for(int row = 0; row < enclosure.length; row++){
+            for(int col = 0; col < enclosure[row].length; col++ ){
+                if(enclosure[row][col] == 's'){
+                    return new int[] {row, col};
+                }
+            }
+        }
+
+        throw new IllegalArgumentException("No salamander present");
+
     }
 }