首页 > 其他 > 详细

657. Judge Route Circle

时间:2019-04-11 11:11:34      阅读:127      评论:0      收藏:0      [点我收藏+]

nitially, 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 tothe 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 boolean judgeCircle(String moves) {
        int x = 0;
        int y = 0;
        for (char ch : moves.toCharArray()) {
            if (ch == ‘U‘)
                y++;
            if (ch == ‘D‘)
                y--;
            if (ch == ‘L‘)
                x--;
            if (ch == ‘R‘)
                x++;
        }
        return x == 0 && y== 0; //检查是否回到了起点处
    }
}

 

657. Judge Route Circle

原文:https://www.cnblogs.com/MarkLeeBYR/p/10688254.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!