#1870
Minimum Speed to Arrive on Time
specialist · 910 · lc medium +31 · verified · 47.7% accepted · 2,449 likes · top 33%
Description
You need to ride n trains in order to reach your destination on time. The total allowed travel time is hour (a floating-point number), and the distance of each train ride is given by dist[i].
Each train departs only at integer-hour marks, so after each ride except the last you must wait until the next integer hour.
Return the minimum positive integer speed (km/h) for all trains to arrive within hour hours, or -1 if it is impossible.
Example 1:
Input: dist = [1,3,2], hour = 6
Output: 1
Explanation: At speed 1:
- The first train ride takes 1/1 = 1 hour.
- Since we are already at an integer hour, we depart immediately at the 1 hour mark. The second train takes 3/1 = 3 hours.
- Since we are already at an integer hour, we depart immediately at the 4 hour mark. The third train takes 2/1 = 2 hours.
- You will arrive at exactly the 6 hour mark.
Example 2:
Input: dist = [1,3,2], hour = 2.7
Output: 3
Explanation: At speed 3:
- The first train ride takes 1/3 = 0.33333 hours.
- Since we are not at an integer hour, we wait until the 1 hour mark to depart. The second train ride takes 3/3 = 1 hour.
- Since we are already at an integer hour, we depart immediately at the 2 hour mark. The third train takes 2/3 = 0.66667 hours.
- You will arrive at the 2.66667 hour mark.
Example 3:
Input: dist = [1,3,2], hour = 1.9
Output: -1
Explanation: It is impossible because the earliest the third train can depart is at the 2 hour mark.
Code
1
2
3