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
1 change: 1 addition & 0 deletions src/Position.java
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@
public record Position (int row, int col) {}
121 changes: 121 additions & 0 deletions src/SalamanderSearch.java
Original file line number Diff line number Diff line change
@@ -1,5 +1,6 @@
import java.util.ArrayList;
import java.util.List;
import java.util.*;

public class SalamanderSearch {
public static void main(String[] args) {
Expand All @@ -18,6 +19,23 @@ public static void main(String[] args) {
{'f','W','.','.','W','.'},
{'W','.','W','.','.','.'},
};

// Set<int[]> coordinateSet = new HashSet<>();
// int[] coord1 = new int[]{1, 5};
// int [] coord2 = new int[]{3, 7};
// int[] coord3 = new int[]{1, 5};

// coordinateSet.add(coord1);
// coordinateSet.add(coord2);
// coordinateSet.add(coord3);

// System.out.println(coordinateSet.size());

// canReach(enclosure1);

Position pos = new Position(3, 5);
System.out.println(pos.row());
System.out.println(pos.col());
}

/**
Expand All @@ -43,6 +61,109 @@ public static void main(String[] args) {
* @return whether the salamander can reach the food
*/
public static boolean canReach(char[][] enclosure) {
int [] start = salamanderLocation(enclosure);
boolean[][] visited = new boolean[enclosure.length][enclosure[0].length];
return canReachHelper(enclosure, start, visited);
}

public static boolean canReachHelper(char[][] enclosure, int[] current, boolean[][] visited) {
int curR = current[0];
int curC = current[1];

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

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

System.out.println(Arrays.toString(current));

visited[curR][curC] = true;

List<int[]> moves = possibleMoves(enclosure, current);

for (int[] move : moves) {
if (canReachHelper (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}, // UP
{1, 0}, // DOWN
{0, -1}, // LEFT
{0, 1} // RIGHT
};

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});
}
}

return moves;

// // 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 r = 0; r < enclosure.length; r++) {
for (int c = 0; c < enclosure[r].length; c++) {
if (enclosure[r][c] == 's') {
return new int[]{r, c};
}
}
}
throw new IllegalArgumentException("No salamander present");
}
}
Loading