采集果实

The solution iterates through each batch of fruits specified in the 'fruits' list. For each batch, it calculates the number of times the hero needs to collect fruits of that type to meet the required quantity. This is done by dividing the number of fruits needed ('number') by the maximum number of fruits that can be collected in one go ('limit'), and taking the ceiling of the result to ensure that we account for any remaining fruits that don't make up a full 'limit'. The time taken for each batch is then calculated by multiplying the number of times the hero needs to collect fruits by the time it takes to collect one batch of fruits of that type ('time[fruit]'). The total time taken ('ans') is the sum of the times taken for all batches.

时间复杂度: O(n)

空间复杂度: O(1)

class Solution:
    def getMinimumTime(self, time: List[int], fruits: List[List[int]], limit: int) -> int:
        ans = 0  # Initialize the total time taken to 0
        for fruit, number in fruits:  # Iterate through each batch of fruits
            ans += ceil(number / limit) * time[fruit]  # Calculate and add the time taken for the current batch
        return ans  # Return the total time taken