leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

1011.cpp (572B)

0 class Solution { 1 public: 2 int shipWithinDays(vector<int> &weights, int days) { 3 int left = 0, right = 25000000; 4 for (int w : weights) 5 left = max(left, w); 6 while (left < right) { 7 int mid = (left + right) / 2, need = 1, cur = 0; 8 for (int i = 0; i < weights.size() && need <= days; cur += weights[i++]) 9 if (cur + weights[i] > mid) cur = 0, need++; 10 if (need > days) 11 left = mid + 1; 12 else 13 right = mid; 14 } 15 return left; 16 } 17 };