zoukankan      html  css  js  c++  java
  • 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

    Solution:
    /**
     * @param {string} moves
     * @return {boolean}
     */
    var judgeCircle = function(moves) {
        var length = moves.length;
        var i = 0;
        var x = 0, y = 0;
        for(;i < length; i++) {
            var charac = moves.charAt(i);
            switch(charac) {
                case 'R':
                    x = x + 1;
                    break;
                case 'L':
                    x = x - 1;
                    break;
                case 'U':
                    y = y - 1;
                    break;
                case 'D':
                    y = y + 1;
                    break;
                default:
                    break;
            }
        }
        if(x == 0 && y == 0) {
            return true;
        } 
        return false;
    };
  • 相关阅读:
    对于git的认识
    第一篇博客
    结对编程
    对git的认识
    李叔同先生的《梦》
    51nod 1449 砝码称重
    LeetCode 21-29题解
    LeetCode 11-20题解
    LeetCode 6-10 题解
    LeetCode刷题重启博客
  • 原文地址:https://www.cnblogs.com/gogolee/p/7495626.html
Copyright © 2011-2022 走看看