第二天了,找点简单的题,坚持坚持!
原题:
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
本题就是给出几个字母,分别用UDLR来表示上下左右,最后看是否走回原处。
我定义了两个变量,LR、UD分别来表示左右方向和上下方向上的位移量,如果两个位移量都是零,则返回true,否则返回false。
贴出我的程序如下:(C语言)
bool judgeCircle(char* moves) {
int LR=0, UD=0;//左右上下移动位数,负数为左、下,正数则反之
int i=0;
int len=strlen(moves);
for(i=0; i<len; i++)
{
if(*(moves+i)=='L')
{
LR--;
}
else if(*(moves+i)=='R')
{
LR++;
}
else if(*(moves+i)=='D')
{
UD--;
}
else if(*(moves+i)=='U')
{
UD++;
}
}
if(!LR && !UD)
{
return true;
}
else
{
return false;
}
}