관리 메뉴

솜씨좋은장씨

[leetCode] 657. Robot Return to Origin (Python) 본문

Programming/코딩 1일 1문제

[leetCode] 657. Robot Return to Origin (Python)

솜씨좋은장씨 2020. 9. 22. 00:05
728x90
반응형

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: 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.

Example 2:

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.

Example 3:

Input: moves = "RRDD"
Output: false

Example 4:

Input: moves = "LDRRLRUULR"
Output: false

 

Constraints:

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

Solution

from collections import Counter

class Solution:
    def judgeCircle(self, moves: str) -> bool:
        cnt = dict(Counter(moves))
        
        cnt_keys = list(cnt.keys())
        
        pairs = [ {"L", "R"}, {"U", "D"}, {"L", "R", "U", "D"} ]
        
        if set(cnt_keys) not in pairs:
            return False
        else:
            if set(cnt_keys) == pairs[0]:
                if cnt['L'] != cnt['R']:
                    return False
            elif set(cnt_keys) == pairs[1]:
                if cnt['U'] != cnt['D']:
                    return False
            elif set(cnt_keys) == pairs[2]:
                if (cnt['L'] != cnt['R']) or (cnt['U'] != cnt['D']):
                    return False
                
        return True

 

SOMJANG/CODINGTEST_PRACTICE

1일 1문제 since 2020.02.07. Contribute to SOMJANG/CODINGTEST_PRACTICE development by creating an account on GitHub.

github.com

 

Comments