solves robot return to origin

Author: anishLearnsToCode

Diff for: README.md

@@ -169,7 +169,7 @@
 | 643 | [Maximum Average SubArray I](https://leetcode.com/problems/maximum-average-subarray-i) | [![Java](assets/java.png)](src/MaximumAverageSubArrayI.java) [![Python](assets/python.png)](python/maximum_average_subarray_I.py) |
 | 645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | [![Java](assets/java.png)](src/SetMismatch.java) [![Python](assets/python.png)](python/set_mismatch.py) |
 | 653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | [![Java](assets/java.png)](src/TwoSumIVInputIsABST.java) [![Python](assets/python.png)](python/two_sum_iv.py) |
-| 657 | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | |
+| 657 | [Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin) | [![Java](assets/java.png)](src/RobotReturnToOrigin.java) [![Python](assets/python.png)](python/robot_return_to_origin.py) |
 | 661 | [Image Smoother](https://leetcode.com/problems/image-smoother) | |
 | 665 | [Non Deceasing Array](https://leetcode.com/problems/non-decreasing-array) | |
 | 669 | [Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree) | |

Diff for: python/robot_return_to_origin.py

@@ -0,0 +1,9 @@
+class Solution:
+    def judgeCircle(self, moves: str) -> bool:
+        vertical, horizontal = 0, 0
+        for move in moves:
+            if move == 'U': vertical += 1
+            elif move == 'D': vertical -= 1
+            elif move == 'R': horizontal += 1
+            elif move == 'L': horizontal -= 1
+        return vertical == 0 and horizontal == 0

Diff for: src/RobotReturnToOrigin.java

@@ -0,0 +1,14 @@
+public class RobotReturnToOrigin {
+    public boolean judgeCircle(String moves) {
+        int vertical = 0, horizontal = 0;
+        for (int index = 0 ; index < moves.length() ; index++) {
+            switch (moves.charAt(index)) {
+                case 'U' -> vertical++;
+                case 'R' -> horizontal++;
+                case 'D' -> vertical--;
+                case 'L' -> horizontal--;
+            }
+        }
+        return vertical == 0 && horizontal == 0;
+    }
+}