#3538

Merge Operations for Minimum Travel Time

international master · 1970 · lc hard +32 · 30.7% accepted · 69 likes · top 8%

Description

A road of length l km has n signs at positions position[0..n-1] (0 and l included). Segment i takes time[i] minutes per km to traverse.

Perform exactly k merges: each merge picks two adjacent internal signs i and i+1, adds their times, and removes sign i.

Return the minimum total travel time from 0 to l after exactly k merges.

Code

1

2

3

class Solution:
    def minTravelTime(self, l: int, n: int, k: int, position: List[int], time: List[int]) -> int:

class Solution:
    def minTravelTime(self, l: int, n: int, k: int, position: List[int], time: List[int]) -> int: