Judge Route Circle

657. Judge Route Circle

  • Description

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
  • Solution
class Solution {
    public boolean judgeCircle(String moves) {
         int heng=0;
         int zong=0;   
            char[] out=moves.toCharArray();       
            for(int i=0;i<out.length;i++){
                if(out[i]=='U'){
                    zong+=1;
                }else if(out[i]=='D'){
                    zong-=1;
                }else if(out[i]=='R'){
                    heng+=1;
                }else if(out[i]=='L'){
                    heng-=1;
                }else{
                    System.out.println("wrong input!");
                }
            }
            return zong==0&&heng==0;


        }


}
  • 将string转为char数组,之后使用char数组进行判断
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值