stations, stations, ..., stations[N-1], where
N = stations.length.
Kmore gas stations so that D, the maximum distance between adjacent gas stations, is minimized.
stations.lengthwill be an integer in range
stations[i]will be an integer in range
Kwill be an integer in range
10^-6of the true value will be accepted as correct.