zoukankan      html  css  js  c++  java
  • LeetCode 1011. Capacity To Ship Packages Within D Days

    原题链接在这里:https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/

    题目:

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

    The i-th 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 D days.

    Example 1:

    Input: weights = [1,2,3,4,5,6,7,8,9,10], D = 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], D = 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], D = 4
    Output: 3
    Explanation: 
    1st day: 1
    2nd day: 2
    3rd day: 3
    4th day: 1, 1

    Note:

    1. 1 <= D <= weights.length <= 50000
    2. 1 <= weights[i] <= 500

    题解:

    For the possible weight capacity, it must be between max(weights) and sum(weights). 

    Because, if it is smaller than weights[i], ship could never carry i. 

    When it is sum(weights), it could ship all in 1 day.

    Binary search with a guess mid.

    Accumate weight from beginning, when sum + w > mid, need a new ship. count of ships plus 1. sum = 0.

    If count > D, then it is late. Need to guess bigger, l = mid+1.

    Otherwise, it is okay. But it could smaller, r = mid.

    Time Complexity: O(nlogm). n = weights.length. m = sum(weights).

    Space: O(1).

    AC Java:

     1 class Solution {
     2     public int shipWithinDays(int[] weights, int D) {
     3         if(weights == null || weights.length == 0){
     4             return 0;
     5         }
     6         
     7         int l = 0;
     8         int r = 0;
     9         for(int w : weights){
    10             l = Math.max(l, w);
    11             r += w;
    12         }
    13         
    14         while(l<r){
    15             int mid = l + (r-l)/2;
    16             int count = 1;
    17             int sum = 0;
    18             for(int w : weights){
    19                 if(sum + w > mid){
    20                     count++;
    21                     sum = 0;
    22                 }
    23                 
    24                 sum += w;
    25             }
    26             
    27             if(count > D){
    28                 l = mid + 1;
    29             }else{
    30                 r = mid;
    31             }
    32         }
    33         
    34         return l;
    35     }
    36 }

    类似Minimize Max Distance to Gas StationKoko Eating Bananas.

  • 相关阅读:
    话说地址栏的URL的最大长度
    程序员,我拿什么来拯救自己
    把女友升级为老婆的时候发生的BUG
    一个精典asp程序引发的错误引起的思考
    [转]提高 Web Service 数据传输效率的基本方法
    整理发布html的select控件实用js操作
    asp.net简单实现导出excel报表
    c#简单实现生成csv文件
    利用sql server直接创建日历
    jQuery学习笔记:效果
  • 原文地址:https://www.cnblogs.com/Dylan-Java-NYC/p/11897101.html
Copyright © 2011-2022 走看看