[LeetCode]#657. Robot Return to Origin

Environment: Python 3.7

Key technique: Complex number

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

The move sequence is represented by a string, and the character moves[i] represents its ith move. Valid moves are 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 way that the robot is “facing” is irrelevant. “R” will always make the robot move to the right once, “L” will always make it move left, etc. Also, assume that the magnitude of the robot’s movement is the same for each move.

Example 1:

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


  1. Use complex number to solve it.


class Solution:
def judgeCircle(self, moves):
way = {'L':-1, 'R':1, 'U':1j, 'D':-1j}
for i in moves:
return total==0




Interesting in any computer science.