Algorithm


Problem Name: 657. Robot Return to Origin

There is a robot starting at the 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.

You are given a string moves that represents the move sequence of the robot where moves[i] represents its ith move. Valid moves are 'R' (right), 'L' (left), 'U' (up), and 'D' (down).

Return true if the robot returns to the origin after it finishes all of its moves, or false otherwise.

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: moves = "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.

Example 2:

Input: moves = "LL"
Output: false
Explanation: The robot moves left twice. It ends up two "moves" to the left of the origin. We return false because it is not at the origin at the end of its moves.

 

Constraints:

  • 1 <= moves.length <= 2 * 104
  • moves only contains the characters 'U', 'D', 'L' and 'R'.

 
 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming


class Solution {
public:
    bool judgeCircle(string moves) {
        int v = 0, h = 0;
        unordered_map < char, int>m{{'R', 1}, {'L', -1}, {'U', -1}, {'D', 1}};
        for(auto x: moves)
            if(x == 'L' || x == 'R') h += m[x];
            else v += m[x];
        return v == 0 && h == 0;
    }
};
Copy The Code & Try With Live Editor

Input

x
+
cmd
moves = "UD"

Output

x
+
cmd
true

#2 Code Example with Java Programming

Code - Java Programming


class Solution {
  public boolean judgeCircle(String moves) {
    int x = 0;
    int y = 0;
    for (char move : moves.toCharArray()) {
      if (move == 'U' || move == 'D') {
        y += move == 'U' ? 1 : -1;
      }
      else {
        x += move == 'L' ? -1 : 1;
      }
    }
    return x == 0 && y == 0;
  }
}
Copy The Code & Try With Live Editor

Input

x
+
cmd
moves = "UD"

Output

x
+
cmd
true

#3 Code Example with Python Programming

Code - Python Programming


class Solution:
    def judgeCircle(self, moves):
        """
        :type moves: str
        :rtype: bool
        """
        x,y = 0, 0
        for char in moves:
            if char=="R": x+=1
            if char=="L": x-=1
            if char=="U": y+=1
            if char=="D": y-=1
        return True if x==0 and y==0 else False
        
Copy The Code & Try With Live Editor

Input

x
+
cmd
moves = "LL"

Output

x
+
cmd
false

#4 Code Example with C# Programming

Code - C# Programming


namespace LeetCode
{
    public class _0657_RobotReturnToOrigin
    {
        public bool JudgeCircle(string moves)
        {
            var x = 0;
            var y = 0;

            foreach (var ch in moves)
            {
                if (ch == 'U')
                    x++;
                if (ch == 'D')
                    x--;
                if (ch == 'R')
                    y++;
                if (ch == 'L')
                    y--;
            }

            return x == 0 && y == 0;
        }
    }
}
Copy The Code & Try With Live Editor

Input

x
+
cmd
moves = "LL"

Output

x
+
cmd
false
Advertisements

Demonstration


Previous
#655 Leetcode Print Binary Tree Solution in C, C++, Java, JavaScript, Python, C# Leetcode
Next
#658 Leetcode Find K Closest Elements Solution in C, C++, Java, JavaScript, Python, C# Leetcode