657. Judge Route Circle

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

原创最新推荐文章于 2021-02-14 19:40:03 发布 · 134 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

84 篇文章

订阅专栏

本文介绍了一个简单的算法，用于判断机器人是否能通过特定的指令序列回到起始位置(0,0)。该算法通过解析字符串中的指令（'U'向上、'D'向下、'L'向左、'R'向右），跟踪机器人在二维平面上的位置变化。

摘要生成于 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 x = 0;
    int y = 0;
    char * step = moves;

    if(moves == NULL){
        return true;
    }

    while((*step)!='\0'){
        if((*step) == 'U'){
            y++;
        }
        if((*step) == 'D'){
            y--;
        }
        if((*step) == 'L'){
            x++;
        }
        if((*step) == 'R'){
            x--;
        }
        step++;
    }

    if(x == 0 && y == 0){
        return true;
    }else{
        return false;
    }
}