657. Judge Route Circle

最新推荐文章于 2021-02-14 19:40:03 发布

YHJunE

最新推荐文章于 2021-02-14 19:40:03 发布

阅读量265

点赞数 1

CC 4.0 BY-SA版权

分类专栏： leetcode刷题

本文链接：https://blog.youkuaiyun.com/yanhangy/article/details/77753011

leetcode刷题专栏收录该内容

33 篇文章

订阅专栏

本文介绍了一个简单的算法，用于判断机器人在给定移动序列后是否回到了起始位置(0,0)。通过计算上下和左右移动的次数，如果最终两者都为零，则表明机器人成功形成了一个闭环。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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: falss

class Solution {
public:
    bool judgeCircle(string moves) {
        int updown = 0, leftright = 0;
        for(int i = 0; i < moves.length(); ++i){
            if(moves[i] == 'L'){
                leftright--;
            }else if(moves[i] == 'R'){
                leftright++;
            }else if(moves[i] == 'U'){
                updown--;
            }else if(moves[i] == 'D'){
                updown++;
            }
        }
        if(updown == 0 && leftright == 0){
            return true;
        }else{
            return false;
        }
    }
};