class Solution {
public:
int minEatingSpeed(vector<int>& piles, int H) {
int l = 1, r = 1e9;
while(l<r){
int m = l+(r-l)/2;
if(isOk(piles,H,m)){
r = m;
}else{
l = m+1;
}
}
return l;
}
bool isOk(vector<int>& a, int H, int k){
int t = 0;
for(int x:a){
if(x%k==0){
t += x/k;
}else{
t += x/k+1;
}
}
return t<=H;
}
};
LeetCode 875. 爱吃香蕉的珂珂 (二分判定、很经典的二分模型)
最新推荐文章于 2021-12-25 22:59:46 发布