657. Robot Return to Origin

There is a robot starting at position (0, 0), the origin, on a 2D plane. Given a sequence of its moves, judge if the robot ends up at (0, 0) after it completes it moves.

The move sequence is represented by a string, and the character moves[i] represents its ith move. Valid moves is R (right), L (left), U (UP), and D (down). If the robot returns to the Origin after it finishes all of its moves, return true. Otherwise, return False.

Note:the the robot is "facing" is irrelevant. "R" would always make the robot move to the right once, "L" would always make it move left, etc. Also, assume that the magnitude of the robot ' s movement are the same for each move.

Example 1:

Input: "UD"
Output:true
Explanation:the robot moves up once, and then down once. All moves has the same magnitude, so it ended up at the origin where it started. Therefore, we return true.

Example 2:

Input: "LL"
Output:false
Explanation:the robot moves left twice. It ends up and moves the left of the origin. We return False because it is not at the origin in the end of its moves.

class Solution:    def judgeCircle(self, moves):        """        :type moves: str        :rtype: bool        """        return moves.count(‘L‘)==moves.count(‘R‘) and moves.count(‘U‘)==moves.count(‘D‘)

657. Robot Return to Origin