leetcode657: Judge Route Circle
来源:互联网 发布:ubuntu 32位iso下载 编辑:程序博客网 时间:2024/06/06 02:24
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 boolean judgeCircle(String moves) {char[] array = moves.toUpperCase().toCharArray();int x = 0;int y = 0;for (int i = 0; i < moves.length(); i++) {if (array[i] == 'R')x++;else if (array[i] == 'L')x--;else if (array[i] == 'U')y++;else if (array[i] == 'D')y--;}if (x == 0 && y == 0)return true;return false;}
阅读全文
0 0
- leetcode657: Judge Route Circle
- Leetcode657. Judge Route Circle
- leetcode657. Judge Route Circle
- python--leetcode657. Judge Route Circle
- Judge Route Circle
- Judge Route Circle
- 657. Judge Route Circle
- 657. Judge Route Circle
- 657. Judge Route Circle
- LeetCode---Judge Route Circle
- 657. Judge Route Circle
- 657. Judge Route Circle
- 657. Judge Route Circle
- 657. Judge Route Circle
- Judge Route Circle
- 657. Judge Route Circle
- 657. Judge Route Circle
- 657.Judge Route Circle
- Divisible [数学]
- Single Number leetcode java
- Sequence I
- 使用turtle库画蛇
- 爬虫之个人理解的基本处理思路
- leetcode657: Judge Route Circle
- 搜索入门--hd 1241 搜索模板
- 致即将毕业的你之每日一编-001
- Spring IoC底层原理
- Linux学习笔记--Python操作mysql数据库(封装基本的增删改查)
- 总结springmvc访问静态资源的三种方式
- 常用的数据字典
- 二分图
- hdu 6150