657. Judge Route Circle
Posted andywu
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了657. Judge Route Circle相关的知识,希望对你有一定的参考价值。
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
题目含义:初始位于坐标(0, 0),UDLR分别表示向上下左右移动,求移动结束后是否位于原点。
1 public boolean judgeCircle(String moves) { 2 int x = 0; 3 int y = 0; 4 for (char ch : moves.toCharArray()) { 5 if (ch == ‘U‘) x--; 6 else if (ch == ‘D‘) x++; 7 else if (ch == ‘R‘) y++; 8 else if (ch == ‘L‘) y--; 9 } 10 return x == 0 && y == 0; 11 }
以上是关于657. Judge Route Circle的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode(657)Judge Route Circle