Welcome to Subscribe On Youtube
Formatted question description: https://leetcode.ca/all/657.html
657. Robot Return to Origin (Easy)
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.
Example 2:
Input: "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.
Solution 1.
// OJ: https://leetcode.com/problems/robotreturntoorigin/
// Time: O(N)
// Space: O(1)
class Solution {
public:
bool judgeCircle(string moves) {
int V = 0, H = 0;
for (char c : moves) {
switch (c) {
case 'U': ++V; break;
case 'D': V; break;
case 'L': ++H; break;
case 'R': H; break;
}
}
return !V && !H;
}
};

class Solution { public boolean judgeCircle(String moves) { String directionsStr = "RLUD"; int[][] directions = { {1, 0}, {1, 0}, {0, 1}, {0, 1} }; int[] position = {0, 0}; int length = moves.length(); for (int i = 0; i < length; i++) { char directionChar = moves.charAt(i); int index = directionsStr.indexOf(directionChar); int[] direction = directions[index]; for (int j = 0; j < 2; j++) position[j] += direction[j]; } return position[0] == 0 && position[1] == 0; } } ############ class Solution { public boolean judgeCircle(String moves) { int x = 0, y = 0; for (int i = 0; i < moves.length(); ++i) { char c = moves.charAt(i); if (c == 'R') ++x; else if (c == 'L') x; else if (c == 'U') ++y; else if (c == 'D') y; } return x == 0 && y == 0; } }

// OJ: https://leetcode.com/problems/robotreturntoorigin/ // Time: O(N) // Space: O(1) class Solution { public: bool judgeCircle(string moves) { int V = 0, H = 0; for (char c : moves) { switch (c) { case 'U': ++V; break; case 'D': V; break; case 'L': ++H; break; case 'R': H; break; } } return !V && !H; } };

class Solution: def judgeCircle(self, moves: str) > bool: x = y = 0 for c in moves: if c == 'R': x += 1 elif c == 'L': x = 1 elif c == 'U': y += 1 elif c == 'D': y = 1 return x == 0 and y == 0 ############ class Solution(object): def judgeCircle(self, moves): """ :type moves: str :rtype: bool """ x = y = 0 dirs = {"U": (0, 1), "D": (0, 1), "L": (1, 0), "R": (1, 0)} for move in moves: dx, dy = dirs[move] x += dx y += dy return x == y == 0

function judgeCircle(moves: string): boolean { let x = 0, y = 0; const dir = { R: [1, 0], L: [1, 0], U: [0, 1], D: [0, 1], }; for (let u of moves) { const [dx, dy] = dir[u]; x += dx; y += dy; } return !x && !y; }