파비의 매일매일 공부기록

2023.11.08 Today's Challenge 본문

Problem Solving/LeetCode

2023.11.08 Today's Challenge

fabichoi 2023. 11. 8. 23:45

https://leetcode.com/problems/determine-if-a-cell-is-reachable-at-a-given-time/?envType=daily-question&envId=2023-11-08

 

Determine if a Cell Is Reachable at a Given Time - LeetCode

Can you solve this real interview question? Determine if a Cell Is Reachable at a Given Time - You are given four integers sx, sy, fx, fy, and a non-negative integer t. In an infinite 2D grid, you start at the cell (sx, sy). Each second, you must move to a

leetcode.com

x, y 축에 대해 간단한 이해만 있으면 되는 문제

class Solution:
    def isReachableAtTime(self, sx: int, sy: int, fx: int, fy: int, t: int) -> bool:
        w, h = abs(sx - fx), abs(sy - fy)
        if w == 0 and h == 0 and t == 1:
            return False
        return t >= max(w, h)
반응형

'Problem Solving > LeetCode' 카테고리의 다른 글

2023.11.10 Today's Challenge  (0) 2023.11.10
2023.11.09 Today's Challenge  (0) 2023.11.09
2023.11.07 Today's Challenge  (0) 2023.11.07
2023.11.06 Today's Challenge  (1) 2023.11.06
2023.11.05 Today's Challenge  (0) 2023.11.05
'Problem Solving/LeetCode' Related Articles more
Comments