Discover Packages
github.com/openset/leetcode
problems
line-reflection
package
Version:
v1.6.3
Opens a new window with list of versions in this module.
Published: May 30, 2020
License: MIT
Opens a new window with license information.
Imports: 0
Opens a new window with list of imports.
Imported by: 0
Opens a new window with list of known importers.
README
README
¶
< Previous
Next >
Given n points on a 2D plane, find if there is such a line parallel to y-axis that reflect the given points.
Example 1:
Input: [[1,1],[-1,1]]
Output: true
Example 2:
Input: [[1,1],[-1,-1]]
Output: false
[Hash Table ]
[Math ]
Similar Questions
Max Points on a Line (Hard)
Number of Boomerangs (Easy)
Hints
Hint 1
Find the smallest and largest x-value for all points.
Hint 2
If there is a line then it should be at y = (minX + maxX) / 2.
Hint 3
For each point, make sure that it has a reflected point in the opposite side.
Expand ▾
Collapse ▴
Documentation
¶
There is no documentation for this package.
Source Files
¶
Click to show internal directories.
Click to hide internal directories.