Formatted question description: https://leetcode.ca/all/874.html

# 874. Walking Robot Simulation (Easy)

A robot on an infinite grid starts at point (0, 0) and faces north.  The robot can receive one of three possible types of commands:

• -2: turn left 90 degrees
• -1: turn right 90 degrees
• 1 <= x <= 9: move forward x units

Some of the grid squares are obstacles.

The i-th obstacle is at grid point (obstacles[i], obstacles[i])

If the robot would try to move onto them, the robot stays on the previous grid square instead (but still continues following the rest of the route.)

Return the square of the maximum Euclidean distance that the robot will be from the origin.

Example 1:

Input: commands = [4,-1,3], obstacles = []
Output: 25
Explanation: robot will go to (3, 4)


Example 2:

Input: commands = [4,-1,4,-2,4], obstacles = [[2,4]]
Output: 65
Explanation: robot will be stuck at (1, 4) before turning left and going to (1, 8)


Note:

1. 0 <= commands.length <= 10000
2. 0 <= obstacles.length <= 10000
3. -30000 <= obstacle[i] <= 30000
4. -30000 <= obstacle[i] <= 30000
5. The answer is guaranteed to be less than 2 ^ 31.

Companies: Jane Street

Related Topics: Greedy

## Solution 1.

Notice that the question asks for the maximum distance, not the final distance.

// OJ: https://leetcode.com/problems/walking-robot-simulation/

// Time: O(C)
// Space: O(O)
class Solution {
private:
long long hash(int x, int y) {
return (long long)(x + 30000) * 100000 + y + 30000;
}
public:
int robotSim(vector<int>& commands, vector<vector<int>>& obstacles) {
unordered_set<long long> obs;
for (auto &ob : obstacles) obs.insert(hash(ob, ob));
int ans = 0, x = 0, y = 0, dir = 0; // 0=N, 1=W, 2=S, 3=E
int dirs = { {0, 1}, {-1, 0}, {0, -1}, {1, 0} };
for (int cmd : commands) {
if (cmd == -2) {
dir = (dir + 1) % 4;
} else if (cmd == -1) {
dir = (dir + 3) % 4;
} else {
auto &d = dirs[dir];
while (cmd--) {
if (obs.find(hash(x + d, y + d)) != obs.end()) break;
x += d;
y += d;
ans = max(ans, x * x + y * y);
}
}
}
return ans;
}
};


Java

class Solution {
public int robotSim(int[] commands, int[][] obstacles) {
int[][] directions = { {0, 1}, {1, 0}, {0, -1}, {-1, 0} };
int directionIndex = 0;
Map<Integer, List<Integer>> obstaclesEachX = new HashMap<Integer, List<Integer>>();
Map<Integer, List<Integer>> obstaclesEachY = new HashMap<Integer, List<Integer>>();
for (int[] obstacle : obstacles) {
int obstacleX = obstacle, obstacleY = obstacle;
List<Integer> obstaclesX = obstaclesEachX.getOrDefault(obstacleX, new ArrayList<Integer>());
obstaclesEachX.put(obstacleX, obstaclesX);
List<Integer> obstaclesY = obstaclesEachY.getOrDefault(obstacleY, new ArrayList<Integer>());
obstaclesEachY.put(obstacleY, obstaclesY);
}
int positionX = 0, positionY = 0;
int maxDistance = 0;
int length = commands.length;
for (int i = 0; i < length; i++) {
int command = commands[i];
if (command < 0) {
if (command == -1)
directionIndex = directionIndex == 3 ? 0 : directionIndex + 1;
else if (command == -2)
directionIndex = directionIndex == 0 ? 3 : directionIndex - 1;
} else {
int[] direction = directions[directionIndex];
if (directionIndex % 2 == 0) {
List<Integer> obstaclesList = obstaclesEachX.getOrDefault(positionX, new ArrayList<Integer>());
for (int j = 1; j <= command; j++) {
int nextY = positionY + direction;
if (obstaclesList.contains(nextY))
break;
else {
positionY = nextY;
maxDistance = Math.max(maxDistance, positionX * positionX + positionY * positionY);
}
}
} else {
List<Integer> obstaclesList = obstaclesEachY.getOrDefault(positionY, new ArrayList<Integer>());
for (int j = 1; j <= command; j++) {
int nextX = positionX + direction;
if (obstaclesList.contains(nextX))
break;
else {
positionX = nextX;
maxDistance = Math.max(maxDistance, positionX * positionX + positionY * positionY);
}
}
}
}
}
return maxDistance;
}
}