[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

思路：

给定一个字符串代表机器人移动的方向，U表示上，D表示下，L表示左，R表示右，判断最后是否回到原点
*设置原点为（0,0），x表示横坐标，y表示纵坐标

 1 public class Solution657 {
 2      public boolean judgeCircle(String moves) {
 3             int x = 0,y = 0;
 4             for(int i = 0; i < moves.length();i++){
 5                 if(moves.charAt(i)=='U') y++;
 6                 if(moves.charAt(i)=='D') y--;
 7                 if(moves.charAt(i)=='L') x--;
 8                 if(moves.charAt(i)=='R') x++;
 9             }
10             if(x==0&&y==0) return true;
11             else return false;
12         }
13     public static void main(String[] args) {
14         // TODO Auto-generated method stub
15         Solution657 solution657 = new Solution657();
16         String moves = "UDUDLRL";
17         if(solution657.judgeCircle(moves)==true){
18             System.out.println(1);
19         }else {
20             System.out.println(0);
21         }
22     }
23
24 }

转载于:https://www.cnblogs.com/zlz099/p/8507625.html

[LeetCode]657.Judge Route Circle相关推荐

LeetCode 657. Judge Route Circle
题目: Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this rob ...
【Lintcode】1104. Judge Route Circle
题目地址: https://www.lintcode.com/problem/judge-route-circle/description 在平面直角坐标系里,以方向给一个出发点在(0,0)(0,0) ...
Judge Route Circle
这道题为简单题,网上通过率接近70%,我就不怎么仔细讲了题目: 思路: 题目太简单,我也没怎么多想,直接暴力解决,然后就导致时间运行太慢 = = 代码: 1.这是我的写的,很菜 1 class So ...
[leetcode] online judge题目汇总
最近在leetcode online judge刷题,132道题也做了一半多,略有心得.另外这个online judge对题目没有分类,也没有说明难度,新人上手无法由浅入深,也不能集中练习某些类型的题 ...
LeetCode 657 : Robot Return to Origin
题目地址:Robot Return to Origin - LeetCode Acceptance:70.8% Difficulty:Easy There is a robot starting at ...
[LeetCode Online Judge]系列-求二维平面内在一条直线上的最大点数
2019独角兽企业重金招聘Python工程师标准>>> Max Points on a Line Given n points on a 2D plane, find the max ...
LeetCode 657. 机器人能否返回原点
文章目录 1. 题目 2. 解题 1. 题目在二维平面上,有一个机器人从原点 (0, 0) 开始.给出它的移动顺序,判断这个机器人在完成移动后是否在 (0, 0) 处结束. 移动顺序由字符串表示.字 ...
LeetCode Online Judge 题目C# 练习 - Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which ...
LeetCode Online Judge 题目C# 练习 - Search in Rotated Sorted Array II
Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this ...

[LeetCode]657.Judge Route Circle

[LeetCode]657.Judge Route Circle相关推荐

最新文章

热门文章