_1496.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.Objects;
importjava.util.Stack;

publicclass_1496 {
publicstaticclassSolution1 {
publicbooleanisPathCrossing(Stringpath) {
Stack<Coord> visited = newStack<>();
visited.add(newCoord(0, 0));
for (charc : path.toCharArray()) {
Coordlast = visited.peek();
if (c == 'N') {
CoordnextStep = newCoord(last.x, last.y + 1);
if (visited.contains(nextStep)) {
returntrue;
 }
visited.add(nextStep);
 } elseif (c == 'S') {
CoordnextStep = newCoord(last.x, last.y - 1);
if (visited.contains(nextStep)) {
returntrue;
 }
visited.add(nextStep);
 } elseif (c == 'E') {
CoordnextStep = newCoord(last.x - 1, last.y);
if (visited.contains(nextStep)) {
returntrue;
 }
visited.add(nextStep);
 } elseif (c == 'W') {
CoordnextStep = newCoord(last.x + 1, last.y);
if (visited.contains(nextStep)) {
returntrue;
 }
visited.add(nextStep);
 }
 }
returnfalse;
 }

staticclassCoord {
intx;
inty;

publicCoord(intx, inty) {
this.x = x;
this.y = y;
 }

@Override
publicbooleanequals(Objecto) {
if (this == o) {
returntrue;
 }
if (o == null || getClass() != o.getClass()) {
returnfalse;
 }
Coordcoord = (Coord) o;
returnx == coord.x && y == coord.y;
 }

@Override
publicinthashCode() {
returnObjects.hash(x, y);
 }
 }
 }
}