describe
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.
Copy the code
Example 2:
Input: points = [(3, 1), (9, 0), (1, 0], [1, 4], [5], [8]] Output: 3Copy the code
Note:
n == points.length
2 <= n <= 105
points[i].length == 2
0 <= xi, yi <= 109
Copy the code
parsing
The width of the points[I][0] is the maximum. The width of the points[I][0] is the maximum. The width of the x coordinates is the maximum.
answer
class Solution(object):
def maxWidthOfVerticalArea(self, points):
"""
:type points: List[List[int]]
:rtype: int
"""
points = [p[0] for p in points]
points.sort()
res = float("-inf")
for i in range(1,len(points)):
a = points[i]
b = points[i-1]
res = max(a-b, res)
return res
Copy the code
The results
Runtime: 700 ms, Each node has 2 Points Containing No Points in the linked list Usage: Each of the Python online submissions for Vertical Area Between Two Points Containing No Points.Copy the code
Original link: leetcode.com/problems/wi…
Your support is my biggest motivation