Java迷宫算法 Java迷宫算法

package maze; public interface State { String SOUTH = "SOUTH"; String WEST = "WEST"; String NORTH = "NORTH"; String EAST = "EAST"; void left(Person p); void right(Person p); boolean run(Person p); abstract String getState(); } class SouthState implements State { @Override public void left(Person p) { p.state = new EastState(); } @Override public void right(Person p) { p.state = new WestState(); } @Override public String getState() { return SOUTH; } @Override public boolean run(Person p) { if (p.isBackPath()) return false; p.y++; if (Maze.isThrough(p.x, p.y, p.maze)) { p.path.push(new Point(p.x, p.y, getState())); return true; } else { p.y--; return false; } } } class WestState implements State { @Override public void left(Person p) { p.state = new SouthState(); } @Override public void right(Person p) { p.state = new NorthState(); } @Override public String getState() { return WEST; } @Override public boolean run(Person p) { if (p.isBackPath()) return false; p.x--; if (Maze.isThrough(p.x, p.y, p.maze)) { p.path.push(new Point(p.x, p.y, getState())); return true; } else { p.x++; return false; } } } class NorthState implements State { @Override public void left(Person p) { p.state = new WestState(); } @Override public void right(Person p) { p.state = new EastState(); } @Override public String getState() { return NORTH; } @Override public boolean run(Person p) { if (p.isBackPath()) return false; p.y--; if (Maze.isThrough(p.x, p.y, p.maze)) { p.path.push(new Point(p.x, p.y, getState())); return true; } else { p.y++; return false; } } } class EastState implements State { @Override public void left(Person p) { p.state = new NorthState(); } @Override public void right(Person p) { p.state = new SouthState(); } @Override public String getState() { return EAST; } @Override public boolean run(Person p) { if (p.isBackPath()) return false; p.x++; if (Maze.isThrough(p.x, p.y, p.maze)) { p.path.push(new Point(p.x, p.y, getState())); return true; } else { p.x--; return false; } } }