Leetcode-875爱吃香蕉的珂珂

class Solution:
    def minEatingSpeed(self, piles: List[int], h: int) -> int:
        def check(k):
            hours = 0
            for num in piles:
                hours += ceil(num / k)
            return hours <= h

        left, right = max(1, sum(piles) // h), max(piles)
        while left < right:
            mid = left + (right - left) // 2
            if check(mid):
                right = mid
            else:
                left = mid + 1
        return left