1011.capacity to ship packages within d days

class Solution {
    public int shipWithinDays(int[] weights, int days) {
        int max=0;
        // Arrays.sort(weights);
        for(int i=0;i<weights.length;i++){
                max+=weights[i];
        }
        int ans=binary(weights,days,1,max);
        return ans;
    }
    static int binary(int arr[],int days,int s,int h){
        int l=s;
        int r=h;
        int si=-1;
        while(l<=r){
            int mid=l+(r-l)/2;
            if(all(mid,arr,days)){
//    System.out.println("mid"+mid);
                      si=mid;
                      r=mid-1;
            }
            else{
                l=mid+1;
            }
        }
        return si;
    }
    static boolean all(int mid,int arr[],int d){
        int sum=0;
        int c=0;
          for(int i=0;i<arr.length;i++){
             sum+=arr[i];
             if(arr[i]>mid){
                return false;
             }
             else if(sum==mid){
                c+=1;
                sum=0;
             }
            else if(sum>mid){
                c+=1;
                sum=arr[i];
             }
          }
          if(sum!=0){
            c=c+1;
          }
          return c<=d;
    }
}