물음표 살인마의 개발블로그

알고리즘 문제/Leetcode

1637. Widest Vertical Area Between Two Points Containing No Points

BEstyle 2022. 12. 30. 17:12

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.

A vertical area is an area of fixed-width extending infinitely along the y-axis (i.e., infinite height). The widest vertical area is the one with the maximum width.

Note that points on the edge of a vertical area are not considered included in the area.

 

Example 1:

Input: points = [[8,7],[9,9],[7,4],[9,7]]
Output: 1
Explanation: Both the red and the blue area are optimal.

Example 2:

Input: points = [[3,1],[9,0],[1,0],[1,4],[5,3],[8,8]]
Output: 3

 

Constraints:

  • n == points.length
  • 2 <= n <= 105
  • points[i].length == 2
  • 0 <= xi, yi <= 109

class Solution:
    def maxWidthOfVerticalArea(self, points: List[List[int]]) -> int:
        alist=sorted([x[0] for x in points])
        cmax=0
        for i in range(len(alist)-1):
            cmax = max(cmax,alist[i+1]-alist[i])
        return cmax

'알고리즘 문제 > Leetcode' 카테고리의 다른 글

15. 3Sum  (0) 2023.01.10
42. Trapping Rain Water  (0) 2023.01.10
1874. Minimize Product Sum of Two Arrays  (0) 2022.12.30
21. Merge Two Sorted Lists  (0) 2022.12.29
917. Reverse Only Letters  (0) 2022.12.29