Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
89 changes: 89 additions & 0 deletions src/SalamanderSearch.java
Original file line number Diff line number Diff line change
Expand Up @@ -44,6 +44,95 @@ public static void main(String[] args) {
* @throws IllegalArgumentException if the enclosure does not contain a salamander
*/
public static boolean canReach(char[][] enclosure) {

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];

if (enclosure[curR][curC]== 'f') return true;

if (visited[curR][curC]) return false;

visited[curR][curC]= true;
List<int[]> neighbors = possibleMoves(enclosure, current);
for (int [] neighbor : neighbors){

if (canReach(enclosure, neighbor, visited)){
return true;
}
}
return false;

}

public static List<int[]> possibleMoves(char[][] enclosure, int[] current ){
List<int[]> moves = new ArrayList<>();

int curR = current[0];
int curC = current[1];


// 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[newR].length && enclosure[newR][newC]!='W'){

moves.add(new int []{newR, newC});
}

return moves;
}
// o(n*m) n = # of rows , m = # of cols

public static int[] salamanderLocation(char[][] enclosure) {


for(int r = 0; r < enclosure.length; r++){

for( int c = 0; c < enclosure.length; c++){
if (enclosure[r][c]== 's'){

int[] location = new int[]{r,c};

return location;

}
}
}

throw new IllegalArgumentException("No salamander present");

}
}


Loading