파비의 매일매일 공부기록

2023.12.21 Today's Challenge 본문

Problem Solving/LeetCode

2023.12.21 Today's Challenge

fabichoi 2023. 12. 21. 23:45

https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/

 

Widest Vertical Area Between Two Points Containing No Points - LeetCode

Can you solve this real interview question? Widest Vertical Area Between Two Points Containing No Points - Given n points on a 2D plane where points[i] = [xi, yi], Return the widest vertical area between two points such that no points are inside the area.

leetcode.com

단순 정렬 문제

class Solution:
    def maxWidthOfVerticalArea(self, points: List[List[int]]) -> int:
        points.sort()
        res = 0
        for i in range(1, len(points)):
            res = max(res, points[i][0] - points[i-1][0])
        return res
반응형

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

2023.12.23 Today's Challenge  (1) 2023.12.23
2023.12.22 Today's Challenge  (0) 2023.12.22
2023.12.20 Today's Challenge  (1) 2023.12.20
2023.12.19 Today's Challenge  (0) 2023.12.19
2023.12.18 Today's Challenge  (0) 2023.12.18
'Problem Solving/LeetCode' Related Articles more
Comments