[leetcode]657. Judge Route Circle

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 cnt_ud = 0;
        int cnt_lr = 0;
        for(int i=0;i<moves.size();i++)
        {
            if(moves[i]=='U')
                cnt_ud ++;
            else if(moves[i]=='D')
                cnt_ud --;
            else if(moves[i]=='L')
                cnt_lr ++;
            else 
                cnt_lr --;
        }
        if (cnt_lr==0 && cnt_ud ==0)
            return true;
        else 
            return false;
    }
};
  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值