@@ -0,0 +1,590 @@
+public class Solution %7B%0A%0A    public boolean judgeCircle(String moves) %7B%0A%0A        int x = 0;%0A        int y = 0;%0A%0A        for (int i = 0; i %3C moves.length(); i++) %7B%0A%0A            switch (moves.charAt(i)) %7B%0A%0A                case 'R' :%0A                    x++;%0A                    break;%0A                case 'L' :%0A                    x--;%0A                    break;%0A                case 'U' :%0A                    y++;%0A                    break;%0A                case 'D' :%0A                    y--;%0A                    break;%0A%0A            %7D%0A%0A        %7D%0A%0A        return x == 0 && y == 0;%0A%0A    %7D%0A%0A%7D%0A

Create : 657 Judge Route Circle