LeetCode Judge Route Circle

原题链接在这里：https://leetcode.com/problems/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 1:

Input: "UD"
Output: true

Example 2:

Input: "LL"
Output: false

题解：

判断'U'和'D' && 'R'和 'L'的个数是否相同.

Time Complexity: O(moves.length()). Space: O(1).

AC Java:

 1 class Solution {
 2     public boolean judgeCircle(String moves) {
 3         int x = 0;
 4         int y = 0;
 5         for(int i = 0; i<moves.length(); i++){
 6             char c = moves.charAt(i);
 7             if(c == 'U'){
 8                 y++;
 9             }else if(c == 'D'){
10                 y--;
11             }else if(c == 'R'){
12                 x++;
13             }else if(c == 'L'){
14                 x--;
15             }
16         }
17         return x==0 && y==0;
18     }
19 }

 

转载于:https://www.cnblogs.com/Dylan-Java-NYC/p/7513082.html