Discover Packages
github.com/openset/leetcode
problems
minimize-max-distance-to-gas-station
package
Version:
v1.4.2
Opens a new window with list of versions in this module.
Published: Jul 8, 2019
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 >
774. Minimize Max Distance to Gas Station (Hard)
[Binary Search ]
Similar Questions
Koko Eating Bananas (Medium)
Hints
Hint 1
Use a binary search. We'll binary search the monotone function "possible(D) = can we use K or less gas stations to ensure each adjacent distance between gas stations is at most D?"
Expand ▾
Collapse ▴
Documentation
¶
There is no documentation for this package.
Source Files
¶
Click to show internal directories.
Click to hide internal directories.