[LeetCode] 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:

• -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][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.

Example1:

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

Example2:

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)

解题思路:
采用模拟机器人移动，每次在坐标轴上移动1个单位。
移动时检查是否碰到障碍物，并更新最大距离。

解题关键:

1. 方向的表示：
   假设坐标x,y，其中{0,1} 代表 北，{1,0}代表东， {0,-1}代表南，{-1,0}代表南
   则有方向数组

int dirction[4][2] = {{0,1}, {1,0}, {0,-1}, {-1,0}};

其中索引0~4依次代表东南西北
设初始化方位为0，其范围为0~4

int dir = 0;

每次向右转，dir+1, 并且取余4

dir = (dir + 1) % 4;

同理，向左转,dir-1,并且+4 取余4 以确保其范围在0~4之间

dir = (dir -1 + 4) % 4;

2. 障碍物的检测
   我们将全部的障碍物放在一个集合中，每次迭代，检测是否会碰到障碍物

set<pair<int,int>> obstacleSet;
for(vector<int> obstacle:obstacles)
	 obstacleSet.insert(make_pair(obstacle[0],obstacle[1]));

完整代码

class Solution {
public:
    int robotSim(vector<int>& commands, vector<vector<int>>& obstacles) {
        int dirc[4][2] = {{0,1}, {1,0},{0,-1},{-1,0}}; // N E S W
        
        int x = 0, y = 0, di = 0;
        
        set<pair<int,int>> obstacleSet;
        for(vector<int> obstacle : obstacles)
            obstacleSet.insert(make_pair(obstacle[0],obstacle[1]));
        
        int ans = 0;
        for(int cmd: commands)
        {
            if (cmd == -1) // turn right
                di = (di + 1) % 4;
            else if (cmd == -2)
                di = (di - 1 + 4) % 4;
            else
            {
                int* cur = dirc[di];
                for(int k = 0;k<cmd;++k)
                {
                    int nx = x + cur[0];
                    int ny = y + cur[1];
                    if (obstacleSet.find(make_pair(nx,ny)) == obstacleSet.end())
                    {
                        x = nx;
                        y = ny;
                        ans = max(ans,x*x+y*y);
                    }
                }
            }
        }
        
        return ans;
    }
};