【LeetCode】657 . Judge Route Circle

Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the original place.

The move sequence is represented by a string. And each move is represent by a character. The valid robot moves are R (Right), L (Left), U (Up) and D (down). The output should be true or false representing whether the robot makes a circle.

Example 1:

Input: "UD"
Output: true

Example 2:

Input: "LL"
Output: false

没太懂什么意思，看了别人的解题思路

public class Solution {
    public boolean judgeCircle(String moves) {
        int x = 0, y = 0;
        for (int i = 0; i < moves.length(); i++) {
            if (moves.charAt(i) == 'U') {
                x++;
            }
            if (moves.charAt(i) == 'D') {
                x--;
            }
            if (moves.charAt(i) == 'L') {
                y++;
            }
            if (moves.charAt(i) == 'R') {
                y--;
            }
        }
        if (x == 0 && y == 0) {
            return true;
        }
        return false;
    }
}