Add 1011

Author: trung-hn

Readme.md

@@ -246,6 +246,7 @@
 | 1004 | Max Consecutive Ones III | Medium | O(N) | O(1) | Sliding Window, Two Pointers | | |
 | 1007 | Minimum Domino Rotations For Equal Row | Medium | O(N) | O(1) | Array, Greedy | | |
 | 1010 | Pairs of Songs With Total Durations Divisible by 60 | Medium | O(N) | O(1) | Array, Math | | |
+| 1011 | Capacity To Ship Packages Within D Days | Medium | O(NlogN) | O(1) | Array, Binary Search | | |
 | 1014 | Best Sightseeing Pair | Medium | O(N) | O(1) | Array | | |
 | 1015 | Smallest Integer Divisible by K | Medium | O(K) | O(K) | Math | | |
 | 1022 | Sum of Root To Leaf Binary Numbers | Easy | O(N) | O(H) | Tree | | |

src/1011.capacity-to-ship-packages-within-d-days.py

@@ -0,0 +1,31 @@
+#
+# @lc app=leetcode id=1011 lang=python3
+#
+# [1011] Capacity To Ship Packages Within D Days
+#
+
+# @lc code=start
+# TAGS: Array, Binary Search
+class Solution:
+    def shipWithinDays(self, weights: List[int], D: int) -> int:
+        def within_D_days(cap, D):
+            days = 1
+            cur = 0
+            for w in weights:
+                if cur + w > cap:
+                    days += 1
+                    cur = 0
+                cur += w
+            return days <= D
+        
+        lo = max(weights)
+        hi = sum(weights)
+        while lo < hi:
+            mid = (lo + hi) // 2
+            if within_D_days(mid, D):
+                hi = mid
+            else:
+                lo = mid + 1
+        return lo
+# @lc code=end
+