leetcode657. Judge Route Circle

https://leetcode.com/problems/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

思路:比较简单,主要是一次遍历字符串,遇到RLUD就记录下来,因为最后要返回原点,所以上下之和或左右之和都必须为0,累加到最后判断即可.

class Solution {
public:
    bool judgeCircle(string moves) {
        int count = 0;
        for(int i = 0; i < moves.size(); i++) {
            switch(moves[i]){
                case 'R' : count += 1; break;
                case 'L' : count += -1; break;
                case 'U' : count += 2; break;
                case 'D' : count += -2; break;
            }
        }
        if(count == 0) return true;
        else return false;
    }
};

py
上面的思路有问题，因为垂直和水平是不可互相替代的，用同一个计数器会相互干扰。例如‘RRD’，结果是0，然而回不到原点。应该用两个计数器分别计算。

class Solution:
    def judgeCircle(self, moves):
        """
        :type moves: str
        :rtype: bool
        """

        vertical = 0  #垂直方向
        horizontal = 0  #水平
        for move in moves:
            if move == 'R':
                horizontal += 1
            if move == 'L':
                horizontal -= 1
            if move == 'U':
                vertical += 1
            if move == 'D':
                vertical -= 1
        return vertical == 0 and horizontal == 0