leetcode-Judge-Route-Circle

2017-08-23
#java
leetcode

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 1:
Input: “UD”
Output: true
Example 2:
Input: “LL”
Output: false

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

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