class Solution {
public:
bool judgeCircle(string moves) {
int x = 0;
int y = 0;
for (int i = 0; i < moves.length(); i++)
{
if (moves[i] == 'L') x--;
if (moves[i] == 'R') x++;
if (moves[i] == 'U') y++;
if (moves[i] == 'D') y--;
}
return (!x) && (!y);
}
};
657. Judge Route Circle的C++解法
最新推荐文章于 2020-10-21 11:12:56 发布