每日一道Leetcode算法—— Robot Return to Origin——2019.02.14

题干：

中文：

在2D平面上有一个从位置（0,0）开始的机器人。给定其移动序列，判断该机器人在完成移动后是否在（0,0）处结束。

移动序列由字符串表示，字符move [i]表示其第i个移动。有效移动是R（右），L（左），U（上）和D（下）。如果机器人在完成所有移动后返回原点，则返回true。否则，返回false。

注意：机器人“面对”的方式无关紧要。 “R”将始终使机器人向右移动一次，“L”将始终向左移动等。此外，假设每次移动机器人的移动幅度相同。

Example 1:

Input: "UD"
Output: true 
Explanation: 
机器人向上移动一次，然后向下移动一次。所有动作都具有相同的幅度，因此它最终位于它开始的原点。因此，我们返回true。

Example 2:

Input: "LL"
Output: false
Explanation: 
机器人向左移动两次。它最终在原点的左边有两个“移动”。我们返回false，因为它在移动结束时不在原点。

英文：

 

There is a robot starting at position (0, 0), the origin, on a 2D plane. Given a sequence of its moves, judge if this robot ends up at (0, 0) after it completes its moves.

The move sequence is represented by a string, and the character moves[i] represents its ith move. Valid moves are R (right), L (left), U (up), and D (down). If the robot returns to the origin after it finishes all of its moves, return true. Otherwise, return false.

Note: The way that the robot is "facing" is irrelevant. "R" will always make the robot move to the right once, "L" will always make it move left, etc. Also, assume that the magnitude of the robot's movement is the same for each move.

Example 1:

Input: "UD"
Output: true 
Explanation: The robot moves up once, and then down once. All moves have the same magnitude, so it ended up at the origin where it started. Therefore, we return true.

Example 2:

Input: "LL"
Output: false
Explanation: The robot moves left twice. It ends up two "moves" to the left of the origin. We return false because it is not at the origin at the end of its moves.

---

解题思路：

由于左右上下移动距离都是一样的，
所以我们把左右定义为一组，并设置变量初识值为lr=0，然后向左则+1，向右则-1；
把上下定义为一组，并设置变量初识值为ud，向上则+1，向下则-1。
只有两个变量同时为0。才表示回到了原点。

package cn.leetcode.easy;

/**
 * There is a robot starting at position (0, 0), the origin,
 * on a 2D plane. Given a sequence of its moves,
 * judge if this robot ends up at (0, 0) after it completes its moves.
 * The move sequence is represented by a string, and the character moves[i] represents its ith move.
 * Valid moves are R (right), L (left), U (up), and D (down).
 * If the robot returns to the origin after it finishes all of its moves, return true.
 * Otherwise, return false.
 * Note: The way that the robot is "facing" is irrelevant.
 * "R" will always make the robot move to the right once,
 * "L" will always make it move left, etc. Also,
 * assume that the magnitude of the robot's movement is the same for each move.
 *
 * @author kimtian
 * @date 2019.02.14
 * @num 657
 */
public class RobotReturnToOrigin {
    /**
     * 由于左右上下移动距离都是一样的，
     * 所以我们把左右定义为一组，并设置变量初识值为lr=0，然后向左则+1，向右则-1；
     * 把上下定义为一组，并设置变量初识值为ud，向上则+1，向下则-1。
     * 只有两个变量同时为0。才表示回到了原点。
     *
     * @param moves 移动方式
     * @return 是否回到原点
     */
    public static boolean judgeCircle(String moves) {
        //将字符串转化为char数组
        char[] a = moves.toCharArray();
        //上下坐标初始值
        int ud = 0;
        //左右坐标初始值
        int lr = 0;
        //循环char数组
        for (char aa : a) {
            //如果向上，则上下坐标+1
            if (aa == 'U') {
                ud++;
            }
            //如果向下，则上下坐标-1
            else if (aa == 'D') {
                ud--;
            }
            //如果向左，则左右坐标+1
            else if (aa == 'L') {
                lr++;
            }
            //如果向右，则左右坐标-1
            else if (aa == 'R') {
                lr--;
            }
        }
        //上下和左右坐标都为0，才表示回到了原点，返回true
        if (ud == 0 && lr == 0) {
            return true;
        }
        //否则返回false
        return false;
    }

    /**
     * 测试类
     *
     * @param args
     */
    public static void main(String[] args) {
        System.out.println(judgeCircle("UD"));

    }
}