Leetcode 774: 最小化去加油站的最大距离 Minimize Max Distance to Gas Station

中文描述：

给定一个整数阵列加油站，表示加油站在x轴上的位置。给定一个整数k，要求增加k个新的加油站。您可以在x轴上的任何位置添加站点，而不必在整数位置上添加。设penalty()为增加k个新加油站后，相邻加油站之间的最大距离。返回penalty()的最小值。在实际答案的10^-6以内的答案将被接受。

题目描述：

You are given an integer array stations that represents the positions of the gas stations on the x-axis. You are also given an integer k.
You should add k new gas stations. You can add the stations anywhere on the x-axis, and not necessarily on an integer position.
Let penalty() be the maximum distance between adjacent gas stations after adding the k new stations.
Return the smallest possible value of penalty(). Answers within 10-6 of the actual answer will be accepted.

Example 1:

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

Example 2:

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

Constraints:

10 <= stations.length <= 2000
0 <= stations[i] <= 10⁸
stations is sorted in a strictly increasing order.
1 <= k <= 10⁶

Time complexity: $O$