码迷,mamicode.com
首页 > 其他好文 > 详细

657. Judge Route Circle

时间:2017-10-17 16:37:59      阅读:172      评论:0      收藏:0      [点我收藏+]

标签:for   each   down   its   上下左右   int   nbsp   esc   interview   

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

标签:for   each   down   its   上下左右   int   nbsp   esc   interview   

原文地址:http://www.cnblogs.com/wzj4858/p/7682204.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!