首页 > 其他 > 详细

[LeetCode] Judge Route Circle

时间:2017-09-07 16:33:44      阅读:257      评论:0      收藏:0      [点我收藏+]

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
判断路径回环,就是判断L与R,U与D是否相等。这种抵消问题可以用2个标志位来记录字母出现的次数,对对应的字母出现相加减。
class Solution {
public:
    bool judgeCircle(string moves) {
        int x = 0, y = 0;
        for (char c : moves) {
            if (c == U)
                x++;
            else if (c == D)
                x--;
            else if (c == L)
                y++;
            else if (c == R)
                y--;
        }
        return !(x || y);
    }
};
// 19 ms

 

[LeetCode] Judge Route Circle

原文:http://www.cnblogs.com/immjc/p/7490397.html

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