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.
给一个数组 代表 需要运输的货物分别多重，运输的时候 也要按这个先后顺序运。
求如果D天里面运完。 安排的船能满足这次运输任务 一天的运力至少是多少？
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.
例子说明是不能不暗数组顺序来。像(1,10)(2,9)(3,8)(4,7)(5,6) 是不对的 虽然可以得到更小的结果 只要一天能运11就行了。
求算法思路。我也继续思考，想出来回来写答案滴。