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

UDLR分别代表上下左右方向走指令，判断给出的指令字符串能否让小机器人回到原点

    public boolean judgeCircle(String moves) {
        int uCount = 0 ;
        int dCount = 0;
        int lCount = 0;
        int rCount = 0;

        /**
         * UDLR分别计数，如果U=D,L=R表示可以回到原点
         */
        for(Character c : moves.toCharArray()){
            if(c == 'U'){
                uCount ++ ;
            }
            if(c == 'D'){
                dCount ++ ;
            }
            if(c == 'L'){
                lCount ++ ;
            }
            if(c == 'R'){
                rCount ++ ;
            }
        }

        return uCount == dCount && lCount == rCount;

    }