Package g1601_1700.s1637_widest_vertical_area_between_two_points_containing_no_points

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1637 - Widest Vertical Area Between Two Points Containing No Points.

    Medium

    Given n points on a 2D plane where <code>pointsi = x<sub>i</sub>, y<sub>i</sub></code>, 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

    • <code>2 <= n <= 10<sup>5</sup></code>

    • points[i].length == 2

    • <code>0 <= x<sub>i</sub>, y<sub>i</sub><= 10<sup>9</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxWidthOfVerticalArea(Array<IntArray> points)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait