首页 > 其他 > 详细

[LeetCode] Judge Route Circle 判断路线绕圈

时间:2017-09-13 13:43:19      阅读:274      评论:0      收藏:0      [点我收藏+]

 

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

 

s

 

 

 

 

 

 

[LeetCode] Judge Route Circle 判断路线绕圈

原文:http://www.cnblogs.com/grandyang/p/7514416.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!