Clear the Highest Hurdle
A runner faces a track of hurdles and can jump over anything up to their current limit. The function hurdle_race receives the jump height k and a list of hurdle heights height. Each potion dose increases the maximum jump by 1. Return the minimum number of doses needed to clear the tallest hurdle.
Примеры
Ввод
7, [2, 5, 4, 5, 2]Вывод
0Ввод
4, [1, 6, 3, 5, 2]Вывод
2Ввод
1, [1]Вывод
0Нужно реализовать
def hurdle_race(k: int, height: list[int]) -> int:
Теги
arraymath
Jelentkezz be a beküldési előzmények megtekintéséhez
BejelentkezésJelentkezz be az MI-mentor használatához
BejelentkezésVisible tests
1
Input
7, [2,5,4,5,2]Expected
02
Input
4, [1,6,3,5,2]Expected
23
Input
1, [1]Expected
04
Input
0, [5]Expected
55
Input
10, [10,10,10]Expected
06
Input
-4, [1,6,3,5,2]Expected
10Focus radio
Paused · SomaFM · Fluid