874. 行走機器人模擬

模擬

描述方向時有個技巧：int[][] dx = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
分別存儲機器人向上、右、下、左走時，坐標應該如何變換

class Solution {public int robotSim(int[] commands, int[][] obstacles) {int max = 0;int[][] dx = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};int k = 0;Map<String, Boolean> map = new HashMap<>();for (int i = 0; i < obstacles.length; i++) {map.put(obstacles[i][0] + "," + obstacles[i][1], true);}int p = 0, q = 0;for (int command : commands) {if (command == -1) {k = (k + 1) % 4;} else if (command == -2) {k = (k + 4 - 1) % 4;} else {int cur[] = dx[k];for (int i = 0; i < command; i++) {if (map.containsKey((p + cur[0]) + "," + (q + cur[1]))) {break;}p += cur[0];q += cur[1];}max = Math.max(max, p * p + q * q);}}return max;} }

轉載于:https://www.cnblogs.com/acbingo/p/9349541.html

總結

以上是生活随笔為你收集整理的[leetcode] 874. 行走机器人模拟(周赛)的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。