Create capacity-to-ship-packages-within-d-days.cpp

Author: kamyu104

C++/capacity-to-ship-packages-within-d-days.cpp

@@ -0,0 +1,32 @@
+// Time:  O(nlogr)
+// Space: O(1)
+
+class Solution {
+public:
+    int shipWithinDays(vector<int>& weights, int D) {    
+        int left = *max_element(weights.cbegin(), weights.cend());
+        int right = accumulate(weights.cbegin(), weights.cend(), 0);
+        while (left <= right) {
+            int mid = left + (right - left) / 2;
+            if (possible(weights, D, mid)) {
+                right = mid - 1;
+            } else {
+                left = mid + 1;
+            }
+        }
+        return left;
+    }
+
+private:
+    int possible(const vector<int>& weights, int D, int mid) const {
+        int result = 1, curr = 0;
+        for (const auto& w : weights) {
+            if (curr + w > mid) {
+                ++result;
+                curr = 0;
+            }
+            curr += w;
+        }
+        return result <= D;
+    }
+};