Create 1637_Widest_Vertical_Area_Between_Two_Points_Containing_No_Points.md

Author: koji

1637_Widest_Vertical_Area_Between_Two_Points_Containing_No_Points.md

@@ -0,0 +1,36 @@
+## 1637. 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.
+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
+```
+
+
+
+```python
+def maxWidthOfVerticalArea(self, points: List[List[int]]) -> int:
+ # d = 0
+ xs = sorted([x for x, _ in points])
+ # for i in range (len(xs)-1):
+ # if d < xs[i+1]-xs[i]:
+ # d = xs[i+1]-xs[i]
+ # return d
+ return max(xs[i+1]-xs[i] for i in range(len(xs)-1))
+```
+
+
+```
+Runtime: 808 ms, faster than 93.33% of Python3 online submissions for Widest Vertical Area Between Two Points Containing No Points.
+Memory Usage: 54.5 MB, less than 90.11% of Python3 online submissions for Widest Vertical Area Between Two Points Containing No Points.
+```