iT邦幫忙

2021 iThome 鐵人賽

DAY 21
0
自我挑戰組

30天 Leetcode解題之路系列 第 21

Day 21 - Robot Return to Origin

大家好,我是毛毛。ヾ(´∀ ˋ)ノ
廢話不多說開始今天的解題Day~


657. Robot Return to Origin

Question

There is a robot starting at the 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.

You are given a string moves that represents the move sequence of the robot where moves[i] represents its ith move. Valid moves are 'R' (right), 'L' (left), 'U' (up), and 'D' (down).

Return true if the robot returns to the origin after it finishes all of its moves, or false otherwise.

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

Example1

Input: moves = "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.

Example2

Input: moves = "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.

Example3

Input: moves = "RRDD"
Output: false

Example4

Input: moves = "LDRRLRUULR"
Output: false

Constraints

  • 1 <= moves.length <= 2 * 10^4
  • moves only contains the characters 'U', 'D', 'L' and 'R'.

解題

題目

首先先簡單的翻譯一下題目
給一台機器人,會根據輸入的上下左右來移動,要判斷輸入的指令會不會讓機器人回到初始位置。

Think

作法大致上是這樣

  • 分x, y座標,讀到'R'=> +1, 'L'=> -1, 'U'=> 1, 'D'=> -1,最後判斷座標是不是有任何一個是非0的值。
  • C的程式睡醒再補上。

Code

Python

class Solution:
    def judgeCircle(self, moves: str) -> bool:
        dict_moves = {'R':1, 'L':-1, 'U':1, 'D':-1}
        loc = [0, 0]
        
        for index in range(len(moves)):
            if moves[index] == 'R' or moves[index] == 'L':
                loc[0] += dict_moves[moves[index]]
                
            elif moves[index] == 'U' or moves[index] == 'D':
                loc[1] += dict_moves[moves[index]]
        
        if loc[0] != 0 or loc[1] != 0:
            return False
        else:
            return True

C

bool judgeCircle(char * moves){
    int loc[2] = {0};

    for (int index=0 ; index<strlen(moves) ; index++){
        if (moves[index] == 'R'){
            loc[0]++;
        } else if (moves[index] == 'L'){
            loc[0]--;
        } else if (moves[index] == 'U'){
            loc[1]++;
        } else if (moves[index] == 'D'){
            loc[1]--;
        }
    }
  
    if (loc[0] != 0 || loc[1] != 0){
        return false;
    } else {
        return true;
    }
        
}

Result

  • Python

  • C

大家明天見/images/emoticon/emoticon29.gif


上一篇
Day 20 - Valid Anagram
下一篇
Day 22 - Shortest Distance to a Character
系列文
30天 Leetcode解題之路30

尚未有邦友留言

立即登入留言