48. Capacity To Ship Packages Within D Days

Topic :

binary search

Difficulty :

medium

Problem Link :

problem statement

A conveyor belt has packages that must be shipped from one port to another within days days.

The ith package on the conveyor belt has a weight of weights[i]. Each day, we load the ship with packages on the conveyor belt (in the order given by weights). We may not load more weight than the maximum weight capacity of the ship.

Return the least weight capacity of the ship that will result in all the packages on the conveyor belt being shipped within days days.

Example 1:

Input: weights = [1,2,3,4,5,6,7,8,9,10], days = 5
Output: 15
Explanation: A ship capacity of 15 is the minimum to ship 
all the packages in 5 days like this:

1st day: 1, 2, 3, 4, 5
2nd day: 6, 7
3rd day: 8
4th day: 9
5th day: 10

Note that the cargo must be shipped in the order given, 
so using a ship of capacity 14 and splitting the packages into parts like
(2, 3, 4, 5), (1, 6, 7), (8), (9), (10) is not allowed.

Example 2:

Input: weights = [3,2,2,4,1,4], days = 3
Output: 6
Explanation: A ship capacity of 6 is the minimum to ship
all the packages in 3 days like this:

1st day: 3, 2
2nd day: 2, 4
3rd day: 1, 4

Example 3:

Input: weights = [1,2,3,1,1], days = 4
Output: 3
Explanation:
1st day: 1
2nd day: 2
3rd day: 3
4th day: 1, 1

Constraints:

1 <= days <= weights.length <= 5 * 104
1 <= weights[i] <= 500

solution

import java.io.*;
import java.util.*;
 class Ship_Capacity_D_Days
{
   public static void main(String args[])
   { int [] weights={1,2,3,4,5,6,7,8,9,10};
     int days=5;
     System.out.println(shipWithinDays(weights,days));
    }
     static boolean isPossible(int[] weights,int curr_maxMinimumWeight,int days )
    {
        int daysRequired=1;
        int weightsTaken=0;
        
        for(int i=0;i<weights.length;i++)
        {
            if(weights[i]>curr_maxMinimumWeight)
                return false;
            
            if(weightsTaken+weights[i]>curr_maxMinimumWeight)
            {
                daysRequired++;
                weightsTaken=weights[i];
                
                if(daysRequired>days)
                    return false;
            }
            else {
                weightsTaken+=weights[i];
            }
            
        }
        return true;
    }
    
    static int shipWithinDays(int[] weights, int days) {
        int minWeight=Integer.MAX_VALUE;
        int sumOfWeights=0;
        
        for(int weight : weights)
        {
            minWeight=Math.min(minWeight,weight);
            sumOfWeights+=weight;
        }
        
        int low=minWeight;
        int high=sumOfWeights;
        int ans=Integer.MAX_VALUE;
        while(low<=high)
        {
            int mid= low+(high-low)/2;
            int curr_maxMinimumWeight= mid;
            
            if(isPossible(weights,curr_maxMinimumWeight,days))
            {
                ans=curr_maxMinimumWeight;
                high=mid-1;
            }
            else{
                low=mid+1;
            }
        }
        
        return ans;
    }
}