LeetCode - 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
public class Solution { public boolean judgeCircle(String moves) { if (moves == null) return true; int x = 0, y = 0; for (int i=0; i<moves.length(); i++) { char ch = moves.charAt(i); if (ch == 'U') y ++; else if (ch == 'D') y --; else if (ch == 'L') x --; else if (ch == 'R') x ++; } return x==0 && y==0; } }
作者:Pickle
声明:对于转载分享我是没有意见的,出于对博客园社区和作者的尊重一定要保留原文地址哈。
致读者:坚持写博客不容易,写高质量博客更难,我也在不断的学习和进步,希望和所有同路人一道用技术来改变生活。觉得有点用就点个赞哈。