[leetcode]657. Judge Route Circle(Python第九周第一次作业)

题目：

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

思路：

L和R作为一对相反方向，U和D作为一对相反方向，如果能回到原点，那么每一对相反方向所走的路程应该是一样的。所有设置两个变量来代表纵向和横向，如果纵向和横向的变化量都为0说明回到了原点。

代码：

class Solution:
    def judgeCircle(self, moves):
        """
        :type moves: str
        :rtype: bool
        """
        x = 0
        y = 0
        for i in range(0, len(moves)):
            if moves[i] == 'L':
                x -= 1
            elif moves[i] == 'R':
                x += 1
            elif moves[i] == 'U':
                y += 1
            elif moves[i] == 'D':
                y -=1
        if x == 0 and y == 0:
            return True
        else:
            return False