LC-0657 Easy LeetCode

657. Robot Return to Origin

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 76% Topics: String, Simulation

Reading material

Strings 12 min Simulation & Enumeration 9 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

import collections


class Solution(object):
    def judgeCircle(self, moves):
        """
        :type moves: str
        :rtype: bool
        """
        count = collections.Counter(moves)
        return count['L'] == count['R'] and count['U'] == count['D']

 
# Time:  O(n)
# Space: O(1)
class Solution(object):
    def judgeCircle(self, moves):
        """
        :type moves: str
        :rtype: bool
        """
        v, h = 0, 0
        for move in moves:
            if move == 'U':
                v += 1
            elif move == 'D':
                v -= 1
            elif move == 'R':
                h += 1
            elif move == 'L':
                h -= 1
        return v == 0 and h == 0

Solution from kamyu104/LeetCode-Solutions · MIT