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 i<sup>th</sup> 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.

LeetCode Problem - 657

class Solution {
    public boolean judgeCircle(String moves) {
        // Initialize variables to track the robot's position on a 2D grid
        int x = 0, y = 0;

        // Iterate through each move in the string
        for (char c : moves.toCharArray()) {
            // If the move is 'R' (right), increment the x-coordinate
            if (c == 'R') x++;
            // If the move is 'L' (left), decrement the x-coordinate
            else if (c == 'L') x--;

            // If the move is 'U' (up), increment the y-coordinate
            if (c == 'U') y++;
            // If the move is 'D' (down), decrement the y-coordinate
            else if (c == 'D') y--;
        }

        // After processing all moves, check if the robot is back at the origin (0,0)
        if (x == 0 && y == 0) return true;  // Robot returned to the starting point
        return false;  // Robot did not return to the starting point
    }
}