LeetCode 657. Judge Route Circle

weixin_30487701

于 2018-12-06 22:13:00 发布

阅读量106

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/A-Little-Nut/p/10079979.html

本文介绍了一个算法问题，即通过分析一系列移动指令，判断机器人是否最终返回到初始位置(0,0)。移动指令由字符串表示，每个字符代表一次移动：'U'向上，'D'向下，'L'向左，'R'向右。文章提供了一个C++实现的示例代码。

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

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

转载于:https://www.cnblogs.com/A-Little-Nut/p/10079979.html