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.
一開始，機(jī)器人位于(0,0)。輸入一串移動(dòng)次序命令，判斷機(jī)器人是否走了一個(gè)圈，也就是說它是否回到了原點(diǎn)。

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.
移動(dòng)順序是一串字符串。每一步移動(dòng)命令都是一個(gè)字符。有效的移動(dòng)命令包括 R（向右） ，L（向左），U（向上）以及D（向下）。最終的輸出是true或者false,同來表示機(jī)器人是否走了一個(gè)圈。

Example 1: Input: "UD" Output: true Example 2: Input: "LL" Output: false

• 答案

public class Solution {public boolean judgeCircle(String moves) {// x軸坐標(biāo)int x = 0;// y軸坐標(biāo)int y = 0;for (int j = 0, length = moves.length(); j < length; j++) {if (moves.charAt(j) == 'R') {x++;}if (moves.charAt(j) == 'L') {x--;}if (moves.charAt(j) == 'U') {y++;}if (moves.charAt(j) == 'D') {y--;}}// System.out.println("機(jī)器人當(dāng)前的坐標(biāo)是：("+x+","+y+")");return (x==0&&y==0);} }

總結(jié)

以上是生活随笔為你收集整理的LeetCode 答案(Easy)（601-700）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。