875. 爱吃香蕉的珂珂

发表于 更新于 分类于
这是文章开头，显示在主页面，详情请点击此处。
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
class Solution:
    def minEatingSpeed(self, piles: List[int], h: int) -> int:
        def check(x) ->bool:
            ans = 0
            for i in piles:  
                if i%x!=0:  
                    ans += (i//x) + 1
                else:
                    ans += (i//x)
            return ans <= h 
        def search_II(check) ->int:
            piles.sort()
            left = 1
            right = piles[len(piles)-1]
            while left <= right :
                mid = (left+right)>>1
                print(mid )
                if check(mid):
                    right = mid-1
                else:
                    left = mid+1
            return left 
        
        return search_II(check)