[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

思路：

给定一个字符串代表机器人移动的方向，U表示上，D表示下，L表示左，R表示右，判断最后是否回到原点
*设置原点为（0,0），x表示横坐标，y表示纵坐标

public class Solution657 {
     public boolean judgeCircle(String moves) {
            int x = 0,y = 0;
            for(int i = 0; i < moves.length();i++){
                if(moves.charAt(i)=='U') y++;
                if(moves.charAt(i)=='D') y--;
                if(moves.charAt(i)=='L') x--;
                if(moves.charAt(i)=='R') x++;
            }
            if(x==0&&y==0) return true;
            else return false;
        }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Solution657 solution657 = new Solution657();
        String moves = "UDUDLRL";
        if(solution657.judgeCircle(moves)==true){
            System.out.println(1);
        }else {
            System.out.println(0);
        }
    }

}