g0801_0900.s0874_walking_robot_simulation.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g0801_0900.s0874_walking_robot_simulation;
// #Medium #Array #Simulation
import java.util.HashMap;
import java.util.Map;
import java.util.TreeSet;
class Solution {
public int robotSim(int[] commands, int[][] obstacles) {
// 0=right, 1=up, 2=left, 3=down
int direction = 1;
int x = 0;
int y = 0;
int maxDis = 0;
Map> xMap = new HashMap<>(obstacles.length);
Map> yMap = new HashMap<>(obstacles.length);
for (int[] xy : obstacles) {
xMap.computeIfAbsent(xy[0], k -> new TreeSet<>()).add(xy[1]);
yMap.computeIfAbsent(xy[1], k -> new TreeSet<>()).add(xy[0]);
}
for (int cmd : commands) {
if (cmd == -1) {
direction += 3;
direction %= 4;
} else if (cmd == -2) {
direction += 1;
direction %= 4;
} else {
Integer next = null;
switch (direction) {
case 0:
if (yMap.containsKey(y)) {
next = yMap.get(y).ceiling(x + 1);
}
if (next != null) {
x = Math.min(x + cmd, next - 1);
} else {
x += cmd;
}
break;
case 1:
if (xMap.containsKey(x)) {
next = xMap.get(x).ceiling(y + 1);
}
if (next != null) {
y = Math.min(y + cmd, next - 1);
} else {
y += cmd;
}
break;
case 2:
if (yMap.containsKey(y)) {
next = yMap.get(y).floor(x - 1);
}
if (next != null) {
x = Math.max(x - cmd, next + 1);
} else {
x -= cmd;
}
break;
case 3:
if (xMap.containsKey(x)) {
next = xMap.get(x).floor(y - 1);
}
if (next != null) {
y = Math.max(y - cmd, next + 1);
} else {
y -= cmd;
}
break;
default:
// error
break;
}
maxDis = Math.max(maxDis, x * x + y * y);
}
}
return maxDis;
}
}