版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/fly_yr/article/details/77822230
题目
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
分析
题意判断机器人能否按照给定的行走方向回到原点。
前进共有4个选择:U,D,L,R;
只需求出每个方向的前进步数,判断U==D,且L==R即可。
代码
class Solution {
public boolean judgeCircle(String moves) {
if (moves.isEmpty()) {
return true;
}
int countU = 0, countD = 0, countL = 0, countR = 0, len = moves.length();
for (int i = 0; i < len; ++i) {
char c = moves.charAt(i);
switch (c) {
case 'U':
++countU;
break;
case 'D':
++countD;
break;
case 'L':
++countL;
break;
case 'R':
++countR;
break;
default:
return false;
}
}
return countD == countU && countL == countR;
}
}