LeetCode 874. Walking Robot Simulation C++

874. Walking Robot Simulation

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:

1. -2: turn left 90 degrees
2. -1: turn right 90 degrees
3. 1 <= x <= 9: move forward x units
4. Some of the grid squares are obstacles.

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

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][0] <= 30000
4. -30000 <= obstacle[i][1] <= 30000
5. The answer is guaranteed to be less than 2 ^ 31.

Approach

1. 机器人走路，给一串数字命令，-1向右转，-2向左转，其他数字就是走路走多长。这题不难，典型的模拟题，可是这里有很多坑，比如机器人一开始是面向x轴正方向，向右转其实是面向y轴的正方向，方向这里很容易出错，方向对了，基本答案就错不了。为了辨别方向，自己写的老长老长，最后看了官方题解，贼短，用取余的方法代替了if-else判断，惭愧，这里就不贴第一次写的了，又臭又长。

Code

class Solution {
public:
    int robotSim(vector<int>& commands, vector<vector<int>>& obstacles) {
        vector<int>xdir{0,-1,0,1};
        vector<int>ydir{1,0,-1,0};
        set<pair<int, int>>st;
        for (auto &obs:obstacles) {
            st.insert(make_pair(obs[0],obs[1]));
        }
        int x = 0, y = 0,di=0,ans=0;
        for (auto &cmd : commands) {
            if (cmd == -1) {
                di = (di + 3) % 4;
            }
            else if (cmd == -2) {
                di = (di + 1) % 4;
            }else{
                for (int i = 0; i < cmd; i++) {
                    int newx = x + xdir[di];
                    int newy = y + ydir[di];
                    if (st.find(make_pair(newx, newy)) == st.end()) {
                        x = newx;
                        y = newy;
                        ans=max(ans,x*x+y*y);

                    }
                }
            }
        }
        return ans;
    }
};