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-java21 Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
There is a newer version: 1.38
package g0801_0900.s0874_walking_robot_simulation;

// #Medium #Array #Simulation #2022_03_28_Time_16_ms_(93.75%)_Space_50.9_MB_(75.89%)

import java.util.HashMap;
import java.util.Map;
import java.util.TreeSet;

/**
 * 874 - Walking Robot Simulation\.
 *
 * Medium
 *
 * A robot on an infinite XY-plane starts at point `(0, 0)` facing north. The robot can receive a sequence of these three possible types of `commands`:
 *
 * *   `-2`: Turn left `90` degrees.
 * *   `-1`: Turn right `90` degrees.
 * *   `1 <= k <= 9`: Move forward `k` units, one unit at a time.
 *
 * Some of the grid squares are `obstacles`. The i^th obstacle is at grid point obstacles[i] = (x_i, y_i). If the robot runs into an obstacle, then it will instead stay in its current location and move on to the next command.
 *
 * Return _the **maximum Euclidean distance** that the robot ever gets from the origin **squared** (i.e. if the distance is_ `5`_, return_ `25`_)_.
 *
 * **Note:**
 *
 * *   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):
 *
 * 1. Move north 4 units to (0, 4).
 *
 * 2. Turn right.
 *
 * 3. Move east 3 units to (3, 4).
 *
 * The furthest point the robot ever gets from the origin is (3, 4), which squared is 3² + 4² = 25 units away.
 *
 * **Example 2:**
 *
 * **Input:** commands = [4,-1,4,-2,4], obstacles = \[\[2,4]]
 *
 * **Output:** 65
 *
 * **Explanation:**
 *
 * The robot starts at (0, 0):
 *
 * 1. Move north 4 units to (0, 4).
 *
 * 2. Turn right.
 *
 * 3. Move east 1 unit and get blocked by the obstacle at (2, 4), robot is at (1, 4).
 *
 * 4. Turn left.
 *
 * 5. Move north 4 units to (1, 8).
 *
 * The furthest point the robot ever gets from the origin is (1, 8), which squared is 1² + 8² = 65 units away.
 *
 * **Example 3:**
 *
 * **Input:** commands = [6,-1,-1,6], obstacles = []
 *
 * **Output:** 36
 *
 * **Explanation:**
 *
 * The robot starts at (0, 0):
 *
 * 1. Move north 6 units to (0, 6).
 *
 * 2. Turn right.
 *
 * 3. Turn right.
 *
 * 4. Move south 6 units to (0, 0).
 *
 * The furthest point the robot ever gets from the origin is (0, 6), which squared is 6² = 36 units away.
 *
 * **Constraints:**
 *
 * *   1 <= commands.length <= 10⁴
 * *   `commands[i]` is either `-2`, `-1`, or an integer in the range `[1, 9]`.
 * *   0 <= obstacles.length <= 10⁴
 * *   -3 * 10⁴ <= x_i, y_i <= 3 * 10⁴
 * *   The answer is guaranteed to be less than 2³¹.
**/
public 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:
                        x = getXPlusOne(x, y, yMap, cmd, next);
                        break;
                    case 1:
                        y = getXPlusOne(y, x, xMap, cmd, next);
                        break;
                    case 2:
                        x = getXMinusOne(x, y, yMap, cmd, next);
                        break;
                    case 3:
                        y = getXMinusOne(y, x, xMap, cmd, next);
                        break;
                    default:
                        // error
                        break;
                }
                maxDis = Math.max(maxDis, x * x + y * y);
            }
        }
        return maxDis;
    }

    private int getXMinusOne(
            int x, int y, Map> yMap, int cmd, Integer next) {
        if (yMap.containsKey(y)) {
            next = yMap.get(y).floor(x - 1);
        }
        if (next != null) {
            x = Math.max(x - cmd, next + 1);
        } else {
            x -= cmd;
        }
        return x;
    }

    private int getXPlusOne(
            int x, int y, Map> yMap, int cmd, Integer next) {
        if (yMap.containsKey(y)) {
            next = yMap.get(y).ceiling(x + 1);
        }
        if (next != null) {
            x = Math.min(x + cmd, next - 1);
        } else {
            x += cmd;
        }
        return x;
    }
}