leetcode 657. Judge Route Circle

小雨润如酥

于 2017-08-14 09:33:36 发布

阅读量1.2k

点赞数

分类专栏： leetcode 文章标签： c语言 leetcode

本文链接：https://blog.youkuaiyun.com/zhaihaixu/article/details/77153218

版权

leetcode 专栏收录该内容

120 篇文章

订阅专栏

本文介绍了一种通过计算字符串中指令来判断机器人是否回到原点的方法。利用水平和垂直方向上的位移累加，最终判断位移是否为零。

摘要生成于 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: false

就是看看是不是走了一个圈哦

代码如下：

bool judgeCircle(char* moves) {
    int len=strlen(moves);
    int sumhorizontal=0;
    int sumvertical=0;
    for(int n=0;n<len;n++)
    {
        if(*(moves+n)=='U')
            sumvertical++;
        if(*(moves+n)=='D')
            sumvertical--;
        if(*(moves+n)=='L')
            sumhorizontal--;
        if(*(moves+n)=='R')
            sumhorizontal++;
    }
    if(sumhorizontal==0&&sumvertical==0)
        return true;
    return false;
}

算下横纵坐标就ok了。