-
Notifications
You must be signed in to change notification settings - Fork 0
/
PathCrossing.java
53 lines (48 loc) · 1.66 KB
/
PathCrossing.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
import java.util.HashSet;
import java.util.Set;
public class PathCrossing {
static boolean isPathCrossing(String path) {
Set coordinates = new HashSet<>();
int x = 0;
int y = 0;
coordinates.add("0, 0");
for (int i = 0; i < path.length(); i++) {
if (path.substring(i, i + 1).equals("N")) {
x++;
if (coordinates.contains(String.valueOf(x + ", " + y))) {
return true;
} else {
coordinates.add(String.valueOf(x + ", " + y));
}
}
if (path.substring(i, i + 1).equals("S")) {
x--;
if (coordinates.contains(String.valueOf(x + ", " + y))) {
return true;
} else {
coordinates.add(String.valueOf(x + ", " + y));
}
}
if (path.substring(i, i + 1).equals("W")) {
y--;
if (coordinates.contains(String.valueOf(x + ", " + y))) {
return true;
} else {
coordinates.add(String.valueOf(x + ", " + y));
}
}
if (path.substring(i, i + 1).equals("E")) {
y++;
if (coordinates.contains(String.valueOf(x + ", " + y))) {
return true;
} else {
coordinates.add(String.valueOf(x + ", " + y));
}
}
}
return false;
}
public static void main(String[] args) {
System.out.println(isPathCrossing("NEEEEEEEEEENNNNNNNNNNWWWWWWWWWW"));
}
}