[Leetcode] 657. Judge Route Circle 解题报告

最新推荐文章于 2018-06-29 21:20:21 发布

原创最新推荐文章于 2018-06-29 21:20:21 发布 · 201 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Leetcode #解题报告 #string

IT公司面试习题专栏收录该内容

736 篇文章

订阅专栏

本文介绍了一个简单的问题：根据一系列的移动指令判断机器人是否回到了初始位置。通过计数上下左右移动的数量来决定最终位置是否与起点重合。

题目：

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 up = 0, right = 0;
        for (int i = 0; i < moves.length(); ++i) {
            switch(moves[i]) {
                case 'U':
                    ++up;
                    break;
                case 'D':
                    --up;
                    break;
                case 'L':
                    --right;
                    break;
                case 'R':
                    ++right;
                    break;
                default:
                    break;
            }
        }
        return up == 0 && right == 0;
    }
};