标签：Origin Return move up robot 657 moves its left
There is a robot starting at position (0, 0), the origin, on a 2D plane. Given a sequence of its moves, judge if this robot ends up at (0, 0) after it completes its moves.
The move sequence is represented by a string, and the character moves[i] represents its ith move. Valid moves are R (right), L (left), U (up), and D (down). If the robot returns to the origin after it finishes all of its moves, return true. Otherwise, return false.
Note: The way that the robot is "facing" is irrelevant. "R" will always make the robot move to the right once, "L" will always make it move left, etc. Also, assume that the magnitude of the robot's movement is the same for each move.
Example 1:
Input: "UD" Output: true Explanation: The robot moves up once, and then down once. All moves have the same magnitude,
so it ended up at the origin where it started. Therefore, we return true.Example 2:
Input: "LL" Output: false Explanation: The robot moves left twice. It ends up two "moves" to the left of the origin.
We return false because it is not at the origin at the end of its moves.
机器人能否返回原点。
这道题不涉及算法，思路就是模拟，直接上代码了。
时间O(n)
空间O(n) - charArray
Java实现
1 class Solution {
2 public boolean judgeCircle(String moves) {
3 char[] steps = moves.toCharArray();
4 int up = 0;
5 int left = 0;
6 for (char step : steps) {
7 if (step == 'U') {
8 up++;
9 } else if (step == 'D') {
10 up--;
11 } else if (step == 'L') {
12 left++;
13 } else if (step == 'R') {
14 left--;
15 }
16 }
17 return up == 0 && left == 0;
18 }
19 }
标签：Origin,Return,move,up,robot,657,moves,its,left 来源： https://www.cnblogs.com/cnoodle/p/13575052.html
本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享； 2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关； 3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关； 4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除； 5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。