数据结构与算法：leetcode_657_Judge Route Circle

• Description
  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
  Input: “UD”
  Output: true
  Input: “LL”
  Output: false

• Solution

public  boolean judgeCircle(String moves) {
        int xPostion = 0, yPostion = 0;
        for (int i = 0; i < moves.length(); i++) {
            switch (moves.substring(i, i + 1)) {
            case "U":
                yPostion++;
                break;
            case "D":
                yPostion--;
                break;
            case "L":
                xPostion--;
                break;
            case "R":
                xPostion++;
                break;
            default:
                break;
            }
        }
        if (xPostion == 0 && yPostion == 0) {
            System.out.println(true);
            return true;
        } else {
            System.out.println(false);
            return false;
        }

}