657. Judge Route Circle

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

转载最新推荐文章于 2021-02-14 19:40:03 发布 · 48 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/icysnow/p/8126704.html

本文介绍了一个简单的算法，用于判断机器人在给定一系列移动指令后是否能返回初始位置(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: false

题目大概的意思是有个机器人，给定一些列动作判断它最后回到原点没。
思路很简单，回到原点换个话说就是R和L操作数量一样，U和D操作数一样即可。

public class judgeCircle {
    public static boolean judgeCircle(String moves) {
        if(moves!=null&&moves.length()>0)
        {
             int ud=0;
                int lr=0;
                for(int i=0;i<moves.length();i++)
                {
                    if(moves.charAt(i)=='U')
                    {
                        ud++;
                    }
                    if(moves.charAt(i)=='D')
                    {
                        ud--;
                    }
                    if(moves.charAt(i)=='L')
                    {
                        lr++;
                    }
                    if(moves.charAt(i)=='R')
                    {
                        lr--;
                    }
                }
                if(ud==0&&lr==0)
                {
                    return true;
                }
                else {
                    return false;
                }
        }
        else {
            return false;
        }
       
    }
    public static void main(String args[])
    {
        System.out.println(judgeCircle("UD"));
    }
}