neumeiersi91358/BotRoss
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Remove duplicate Queue elements

Browse Source
This commit is contained in:
Your Average Code 2024-01-25 01:30:27 +01:00
parent 8fafea3cdf
commit 7e5d807862
3 changed files with 0 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
src/EscapeBot.java
View File

@ -78,11 +78,6 @@ public class EscapeBot extends Bot {
queue.add(new Move(start + directions[i][0], start + directions[i][1], commands[i])); queue.add(new Move(start + directions[i][0], start + directions[i][1], commands[i]));
} }
queue.add(new Move(start, start - 1, '^'));
queue.add(new Move(start, start + 1, '>'));
queue.add(new Move(start + 1, start, '>'));
queue.add(new Move(start - 1, start, '<'));
while (!queue.isEmpty()) { while (!queue.isEmpty()) {
Move move = queue.poll(); Move move = queue.poll();
if (move.x < 0 || move.x >= size || move.y < 0 || move.y >= size || visited[move.x][move.y]) continue; if (move.x < 0 || move.x >= size || move.y < 0 || move.y >= size || visited[move.x][move.y]) continue;

5
src/RumbleBot.java
View File

@ -96,11 +96,6 @@ public class RumbleBot extends Bot {
queue.add(new Move(start + directions[i][0], start + directions[i][1], commands[i])); queue.add(new Move(start + directions[i][0], start + directions[i][1], commands[i]));
} }
queue.add(new Move(start, start - 1, '^'));
queue.add(new Move(start, start + 1, '>'));
queue.add(new Move(start + 1, start, '>'));
queue.add(new Move(start - 1, start, '<'));
while (!queue.isEmpty()) { while (!queue.isEmpty()) {
Move move = queue.poll(); Move move = queue.poll();
if (move.x < 0 || move.x >= size || move.y < 0 || move.y >= size || visited[move.x][move.y]) continue; if (move.x < 0 || move.x >= size || move.y < 0 || move.y >= size || visited[move.x][move.y]) continue;

5
src/SnakeBot.java
View File

@ -99,11 +99,6 @@ public class SnakeBot extends Bot {
queue.add(new Move(start + directions[i][0], start + directions[i][1], commands[i])); queue.add(new Move(start + directions[i][0], start + directions[i][1], commands[i]));
} }
queue.add(new Move(start, start - 1, '^'));
queue.add(new Move(start, start + 1, '>'));
queue.add(new Move(start + 1, start, '>'));
queue.add(new Move(start - 1, start, '<'));
while (!queue.isEmpty()) { while (!queue.isEmpty()) {
Move move = queue.poll(); Move move = queue.poll();
if (move.x < 0 || move.x >= size || move.y < 0 || move.y >= size || visited[move.x][move.y]) continue; if (move.x < 0 || move.x >= size || move.y < 0 || move.y >= size || visited[move.x][move.y]) continue;