• 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 boolean judgeCircle(String moves) {
            if(moves == null || moves.length() == 0)
                return true;
            int upOrDown = 0;
            int leftOrRight = 0;
            for(int i = 0; i < moves.length(); i++){
                switch (moves.charAt(i)){
                    case 'U':
                        upOrDown ++;
                        break;
                    case 'D':
                        upOrDown --;
                        break;
                    case 'L':
                        leftOrRight --;
                        break;
                    case 'R':
                        leftOrRight ++;
                        break;
                }
            }
            return (upOrDown == 0 && leftOrRight == 0);
        }
    }
  • 相关阅读:
    联表查询用on和where的区别
    了解触发器
    QUIC协议,了解
    SQL Mode
    redis持久化
    Kali Linux渗透测试实战 1.2 环境安装及初始化
    电容降压
    单火取电
    大整数的因子
    最大公约数
  • 原文地址:https://www.cnblogs.com/luckygxf/p/7712106.html
Copyright © 2020-2023  润新知