★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）➤博客园地址：山青咏芝（）➤GitHub地址：➤原文地址： ➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★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 degrees1 <= x <= 9: move forwardxunits
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: 25Explanation: robot will go to (3, 4)
Example 2:
Input: commands = [4,-1,4,-2,4], obstacles = [[2,4]]Output: 65Explanation: robot will be stuck at (1, 4) before turning left and going to (1, 8)
Note:
0 <= commands.length <= 100000 <= obstacles.length <= 10000-30000 <= obstacle[i][0] <= 30000-30000 <= obstacle[i][1] <= 30000- The answer is guaranteed to be less than
2 ^ 31.
机器人在一个无限大小的网格上行走，从点 (0, 0) 处开始出发，面向北方。该机器人可以接收以下三种类型的命令：
-2：向左转 90 度-1：向右转 90 度1 <= x <= 9：向前移动x个单位长度
在网格上有一些格子被视为障碍物。
第 i 个障碍物位于网格点 (obstacles[i][0], obstacles[i][1])
如果机器人试图走到障碍物上方，那么它将停留在障碍物的前一个网格方块上，但仍然可以继续该路线的其余部分。
返回从原点到机器人的最大欧式距离的平方。
示例 1：
输入: commands = [4,-1,3], obstacles = []输出: 25解释: 机器人将会到达 (3, 4)
示例 2：
输入: commands = [4,-1,4,-2,4], obstacles = [[2,4]]输出: 65解释: 机器人在左转走到 (1, 8) 之前将被困在 (1, 4) 处
提示：
0 <= commands.length <= 100000 <= obstacles.length <= 10000-30000 <= obstacle[i][0] <= 30000-30000 <= obstacle[i][1] <= 30000- 答案保证小于
2 ^ 31
376ms
1 class Solution { 2 func robotSim(_ commands: [Int], _ obstacles: [[Int]]) -> Int { 3 let obstacles = obstacles.reduce(into: Set ()){$0.insert($1[0]*100_000+$1[1])} 4 5 var x = 0; var y = 0 6 var dx = 0; var dy = 1 7 var maxDist = 0 8 9 for command in commands {10 switch command {11 case -2:12 swap(&dx,&dy); dx = -dx; break13 case -1:14 swap(&dx,&dy); dy = -dy; break15 default:16 maxDist = max(maxDist,x*x+y*y)17 for _ in 0.. Runtime: 424 ms
Memory Usage: 19.4 MB
1 class Solution { 2 func robotSim(_ commands: [Int], _ obstacles: [[Int]]) -> Int { 3 var set:Set = Set () 4 for obs in obstacles 5 { 6 set.insert(String(obs[0]) + " " + String(obs[1])) 7 } 8 var dirs:[[Int]] = [[0, 1],[1, 0],[0, -1],[-1, 0]] 9 var d:Int = 010 var x:Int = 011 var y:Int = 012 var result:Int = 013 for c in commands14 {15 if c == -116 {17 d += 118 if d == 4 19 {20 d = 021 }22 }23 else if c == -224 {25 d -= 126 if d == -127 {28 d = 329 }30 }31 else32 {33 var num = c34 while(num-- > 0 && !set.contains(String(x + dirs[d][0]) + " " + String(y + dirs[d][1])))35 {36 x += dirs[d][0]37 y += dirs[d][1]38 }39 }40 result = max(result, x * x + y * y)41 }42 return result43 }44 }45 46 /*扩展Int类，实现自增++、自减--运算符*/47 extension Int{48 //后缀--:先执行表达式后再自减49 static postfix func --(num:inout Int) -> Int {50 //输入输出参数num51 let temp = num52 //num减153 num -= 154 //返回减1前的数值55 return temp56 }57 } 428ms
1 class Solution { 2 func robotSim(_ commands: [Int], _ obstacles: [[Int]]) -> Int { 3 var current = (0, 0) 4 var directs = [(0, 1), (1, 0), (0, -1), (-1, 0) ] 5 var i = 0 6 var result = 0 7 var obstacles = Set<[Int]>(obstacles) 8 for command in commands { 9 if command == -1 {10 i = (i + 1) % 411 } else if command == -2 {12 i = (i + 3) % 413 } else {14 for _ in 0.. 436ms
1 class Solution { 2 func robotSim(_ commands: [Int], _ obstacles: [[Int]]) -> Int { 3 var set = Set<[Int]>() 4 for p in obstacles { 5 set.insert(p) 6 } 7 var pos = [0, 0] 8 var x = 0 9 var y = 110 var maxDis = 011 12 for c in commands {13 //turn right 90 degree14 if c == -1 {15 if x == 0 {16 x = y17 y = 018 }19 else {20 y = -x21 x = 022 }23 }24 //turn left 90 degree25 else if c == -2 {26 if x == 0 {27 x = -y28 y = 029 }30 else {31 y = x32 x = 033 }34 }35 else {36 for _ in 0.. 444ms
1 class Solution { 2 func robotSim(_ commands: [Int], _ obstacles: [[Int]]) -> Int { 3 var obst = Set () 4 for o in obstacles { 5 obst.insert("\(o[0])-\(o[1])") 6 } 7 var x = 0 8 var y = 0 9 var res = 010 let dirX = [0, 1, 0, -1]11 let dirY = [1, 0, -1, 0]12 var dir = 013 for c in commands {14 if c == -2 {15 dir -= 116 if dir < 0 { dir = 3 }17 } else if c == -1 {18 dir += 119 dir %= 420 } else {21 inner: for _ in 1...c {22 let newX = x + dirX[dir]23 let newY = y + dirY[dir]24 if !obst.contains("\(newX)-\(newY)") {25 x = newX26 y = newY27 } else {28 break inner29 }30 }31 res = max(res, x * x + y * y)32 }33 }34 return res35 }36 } 456ms
1 class Solution { 2 func robotSim(_ commands: [Int], _ obstacles: [[Int]]) -> Int { 3 var direction = 0 4 var coordinate = (0, 0) 5 var result = 0 6 var obstacleSet = Set () 7 for obstacle in obstacles { 8 obstacleSet.insert("\(obstacle[0]) \(obstacle[1])") 9 }10 11 for command in commands {12 if command == -1 {13 direction += 114 if direction == 4 {15 direction = 016 }17 } else if command == -2 {18 direction -= 119 if direction == -1 {20 direction = 321 }22 } else if command >= 1 && command <= 9 {23 var bestMovement = 024 for i in 1...command {25 var targetPoint = ""26 if direction == 0 {27 targetPoint = "\(coordinate.0) \(coordinate.1 + i)"28 } else if direction == 1 {29 targetPoint = "\(coordinate.0 + i) \(coordinate.1)"30 } else if direction == 2 {31 targetPoint = "\(coordinate.0) \(coordinate.1 - i)"32 } else if direction == 3 {33 targetPoint = "\(coordinate.0 - i) \(coordinate.1)"34 }35 36 if obstacleSet.contains(targetPoint) {37 break38 } else {39 bestMovement = i40 }41 }42 43 if direction == 0 {44 coordinate.1 += bestMovement45 } else if direction == 1 {46 coordinate.0 += bestMovement47 } else if direction == 2 {48 coordinate.1 -= bestMovement49 } else if direction == 3 {50 coordinate.0 -= bestMovement51 }52 result = max(result, coordinate.0 * coordinate.0 + coordinate.1 * coordinate.1)53 }54 }55 56 return result57 }58 } 496ms
1 class Solution { 2 func robotSim(_ commands: [Int], _ obstacles: [[Int]]) -> Int { 3 let obstaSet = Set(obstacles) 4 5 var maxDist = 0 6 7 var pos = [0,0] 8 var posI = 1 9 var dir = 110 11 for command in commands {12 if command == -2 {13 if posI == 1 {14 dir *= -115 }16 posI ^= 117 } else if command == -1 {18 if posI == 0 {19 dir *= -120 }21 posI ^= 122 } else {23 for _ in 1...command {24 pos[posI] += dir25 26 if obstaSet.contains(pos) {27 pos[posI] -= dir28 break29 }30 }31 32 maxDist = max(maxDist, pos[0] * pos[0] + pos[1] * pos[1])33 }34 }35 36 return maxDist37 }38 } 940ms
1 class Solution { 2 func robotSim(_ commands: [Int], _ obstacles: [[Int]]) -> Int { 3 enum MoveType{ 4 case left 5 case right 6 case up 7 case down 8 } 9 func modifi(_ type: inout MoveType, _ num: Int) {10 if num == -1 {11 switch type {12 case .down:13 type = .left14 case .up:15 type = .right16 case .left:17 type = .up18 case .right:19 type = .down20 }21 }22 if num == -2 {23 switch type {24 case .down:25 type = .right26 case .up:27 type = .left28 case .left:29 type = .down30 case .right:31 type = .up32 }33 }34 }35 var type: MoveType = .up36 var x = 037 var y = 038 let set: Set = Set(obstacles.map({ "\($0[0])=\($0[1])"}))39 var result = 040 41 for i in (0.. result ? t : result87 }88 return result89 }90 } 1008ms
1 class Solution { 2 enum Direction:Int{ 3 case top = 1 4 case right 5 case bottom 6 case left 7 } 8 9 func robotSim(_ commands: [Int], _ obstacles: [[Int]]) -> Int {10 var newObstacles = Set(obstacles)11 var placeArray:[(Int,Int)] = []12 var currentPlace = (0,0)13 var currentDir = Direction.top14 for step in commands{15 if step == -1{16 if currentDir.rawValue + 1 > 4{17 currentDir = .top18 }else{19 currentDir = Direction.init(rawValue:currentDir.rawValue+1)!20 }21 }else if step == -2 {22 if currentDir.rawValue - 1 < 1{23 currentDir = .left24 }else{25 currentDir = Direction.init(rawValue:currentDir.rawValue-1)!26 }27 }else{28 for _ in 1...step{29 var isbreak = false30 switch currentDir{31 case .top:32 currentPlace.1 += 133 if newObstacles.contains([currentPlace.0,currentPlace.1]){34 currentPlace.1 -= 135 isbreak = true36 }37 case .right:38 currentPlace.0 += 139 if newObstacles.contains([currentPlace.0,currentPlace.1]){40 currentPlace.0 -= 141 isbreak = true42 }43 case .bottom:44 currentPlace.1 -= 145 if newObstacles.contains([currentPlace.0,currentPlace.1]){46 currentPlace.1 += 147 isbreak = true48 }49 case .left:50 currentPlace.0 -= 151 if newObstacles.contains([currentPlace.0,currentPlace.1]){52 currentPlace.0 += 153 isbreak = true54 }55 }56 if isbreak{57 break58 }59 }60 }61 placeArray.append(currentPlace)62 }63 64 return placeArray.map{$0.0 * $0.0 + $0.1 * $0.1}.max() ?? 065 }66 }