LC-0874 Medium LeetCode

874. Walking Robot Simulation

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 58% Topics: Array, Hash Table, Simulation

Reading material

Arrays & Hashing 12 min Simulation & Enumeration 9 min

Reference solution (spoiler · python)

# Time:  O(n + k)
# Space: O(k)

class Solution(object):
    def robotSim(self, commands, obstacles):
        """
        :type commands: List[int]
        :type obstacles: List[List[int]]
        :rtype: int
        """
        directions = [(0, 1), (1, 0), (0, -1), (-1, 0)]
        x, y, i = 0, 0, 0
        lookup = set(map(tuple, obstacles))
        result = 0
        for cmd in commands:
            if cmd == -2:
                i = (i-1) % 4
            elif cmd == -1:
                i = (i+1) % 4
            else:
                for k in xrange(cmd):
                    if (x+directions[i][0], y+directions[i][1]) not in lookup:
                        x += directions[i][0]
                        y += directions[i][1]
                        result = max(result, x*x + y*y)
        return result

Solution from kamyu104/LeetCode-Solutions · MIT