Minimize Max Distance to Gas Station

lcpy gen -n 774   # by problem number
lcpy gen -s minimize_max_distance_to_gas_station   # by problem name

Input: stations = [1,2,3,4,5,6,7,8,9,10], k = 9
Output: 0.50000

Input: stations = [23,24,36,39,46,56,57,65,84,98], k = 1
Output: 14.00000

class Solution:
    # Time: O(n log M) where M = max gap
    # Space: O(1)
    def minmax_gas_dist(self, stations: list[int], k: int) -> float:
        gaps = [stations[i + 1] - stations[i] for i in range(len(stations) - 1)]

        def check(x: float) -> bool:
            return sum(int(g / x) for g in gaps) <= k

        left, right = 0.0, float(max(gaps))
        while right - left > 1e-6:
            mid = (left + right) / 2
            if check(mid):
                right = mid
            else:
                left = mid
        return left