1011. Capacity To Ship Packages Within D Days

题目链接：https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/
解题方法：此题参考博客，遇到序列计算时，利用两个边界指针指定，（这个方法比较好），另外此题用到二分查找，二分查找的思想好理解，这里有ree-debug的代码，从题目的代码看，也是用到了python底层的二分查找代码实现的.
代码：

class Solution {
public:
    int shipWithinDays(vector<int>& weights, int D) {
        int len=weights.size();
        int sum=0,maxval=-1;
        for(int i=0;i<len;i++) {
            sum+=weights[i];
            maxval=max(maxval,weights[i]);
        }
        int low=maxval,high=sum,mid;
        while(low<high){
            mid=(low+high)/2;
            int cur=0,k=1;
            for(int i=0;i<len;i++){
                if(cur+weights[i]>mid){
                    cur=0;
                    k++;
                }
                cur+=weights[i];
            }
            if(k>D) low=mid+1;
            else high=mid;
        }
        return low;
    }
};