2022.6.7-----leetcode. eight hundred and seventy-five

 public int minEatingSpeed(int[] piles, int h) {
        int n=piles.length;
        if(n==1) return piles[0]%h==0?piles[0]/h:piles[0]/h+1;
        int l=1,r=0;
        // Find the maximum speed 
        for(int i=0;i<n;i++){
            if(piles[i]>r) r=piles[i];  
        }
        
        while(l<r){
            int mid=l+r>>1;
            int sum=0;// Total use time 
            for(int i=0;i<n;i++){
                 sum+=piles[i]/mid;
                if(piles[i]%mid!=0) sum++;
            }
            if(sum>h) l=mid+1;
            else r=mid;// Not more than , The current speed may be the minimum speed , Need to keep 
        }
        return l;
    }