Judge Route Circle

最新推荐文章于 2025-12-31 21:25:26 发布

原创最新推荐文章于 2025-12-31 21:25:26 发布 · 161 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #python

LeetCode算法练习笔记-python 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一个简单的算法，用于判断机器人是否能通过特定的指令序列回到起始位置。该算法使用坐标变化来跟踪机器人的移动方向，并最终确定其是否完成了闭环移动。

Description

Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the original place.

The move sequence is represented by a string. And each move is represent by a character. The valid robot moves are R (Right), L(Left), U (Up) and D (down). The output should be true or false representing whether the robot makes a circle.

Example 1:

Input: "UD"
Output: true

Example 2:

Input: "LL"
Output: false

Solution

def judgeCircle(self, moves):
        """
        :type moves: str
        :rtype: bool
        """
        x=0
        y=0
        for a in moves:
            if a=='L':
                x-=1
            elif a=='R':
                x+=1
            elif a=='U':
                y+=1
            elif a=='D':
                y-=1
        return x==0 and y==0