874. Walking Robot Simulation
Description
A robot on an infinite XY-plane starts at point (0, 0)
facing north. The robot receives an array of integers commands
, which represents a sequence of moves that it needs to execute. There are only three possible types of instructions the robot can receive:
-2
: Turn left90
degrees.-1
: Turn right90
degrees.1 <= k <= 9
: Move forwardk
units, one unit at a time.
Some of the grid squares are obstacles
. The ith
obstacle is at grid point obstacles[i] = (xi, yi)
. If the robot runs into an obstacle, it will stay in its current location (on the block adjacent to the obstacle) and move onto the next command.
Return the maximum squared Euclidean distance that the robot reaches at any point in its path (i.e. if the distance is 5
, return 25
).
Note:
- There can be an obstacle at
(0, 0)
. If this happens, the robot will ignore the obstacle until it has moved off the origin. However, it will be unable to return to(0, 0)
due to the obstacle. - North means +Y direction.
- East means +X direction.
- South means -Y direction.
- West means -X direction.
Example 1:
Input: commands = [4,-1,3], obstacles = []
Output: 25
Explanation:
The robot starts at (0, 0)
:
- Move north 4 units to
(0, 4)
. - Turn right.
- Move east 3 units to
(3, 4)
.
The furthest point the robot ever gets from the origin is (3, 4)
, which squared is 32 + 42 = 25
units away.
Example 2:
Input: commands = [4,-1,4,-2,4], obstacles = [[2,4]]
Output: 65
Explanation:
The robot starts at (0, 0)
:
- Move north 4 units to
(0, 4)
. - Turn right.
- Move east 1 unit and get blocked by the obstacle at
(2, 4)
, robot is at(1, 4)
. - Turn left.
- Move north 4 units to
(1, 8)
.
The furthest point the robot ever gets from the origin is (1, 8)
, which squared is 12 + 82 = 65
units away.
Example 3:
Input: commands = [6,-1,-1,6], obstacles = [[0,0]]
Output: 36
Explanation:
The robot starts at (0, 0)
:
- Move north 6 units to
(0, 6)
. - Turn right.
- Turn right.
- Move south 5 units and get blocked by the obstacle at
(0,0)
, robot is at(0, 1)
.
The furthest point the robot ever gets from the origin is (0, 6)
, which squared is 62 = 36
units away.
Constraints:
1 <= commands.length <= 104
commands[i]
is either-2
,-1
, or an integer in the range[1, 9]
.0 <= obstacles.length <= 104
-3 * 104 <= xi, yi <= 3 * 104
- The answer is guaranteed to be less than
231
.
Solutions
Solution 1: Hash table + simulation
We define a direction array $dirs=[0, 1, 0, -1, 0]$ of length $5$, where adjacent elements in the array represent a direction. That is, $(dirs[0], dirs[1])$ represents north, and $(dirs[1], dirs[2])$ represents east, and so on.
We use a hash table $s$ to store the coordinates of all obstacles, so that we can determine in $O(1)$ time whether the next step will encounter an obstacle.
We use two variables $x$ and $y$ to represent the current coordinates of the robot, initially $x = y = 0$. The variable $k$ represents the current direction of the robot, and the answer variable $ans$ represents the maximum Euclidean distance squared of the robot from the origin.
Next, we traverse each element $c$ in the array $commands$:
- If $c = -2$, it means that the robot turns left by $90$ degrees, that is, $k = (k + 3) \bmod 4$;
- If $c = -1$, it means that the robot turns right by $90$ degrees, that is, $k = (k + 1) \bmod 4$;
- Otherwise, it means that the robot moves forward by $c$ units of length. We combine the robot's current direction $k$ with the direction array $dirs$, and we can get the increment of the robot on the $x$ axis and the $y$ axis. We add the increment of $c$ units of length to $x$ and $y$ respectively, and judge whether the new coordinates $(x, y)$ after each move are in the coordinates of obstacles. If not, update the answer $ans$, otherwise stop simulating and perform the simulation of the next instruction.
Finally return the answer $ans$.
Time complexity is $O(C \times n + m)$, space complexity is $O(m)$. Where $C$ represents the maximum number of steps that can be moved each time, and $n$ and $m$ respectively represent the lengths of arrays $commands$ and arrays $obstacles$.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 |
|
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 |
|
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 |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 |
|
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 |
|