Create 410-Split-Array-Largest-Sum.py

neetcode-gh · web-flow · commit 789350bd87b0 · 2022-03-30T23:41:55.000-07:00
diff --git a/410-Split-Array-Largest-Sum.py b/410-Split-Array-Largest-Sum.py
@@ -0,0 +1,22 @@
+class Solution:
+    def splitArray(self, nums: List[int], m: int) -> int:
+        def canSplit(largest):
+            subarray = 0
+            curSum = 0
+            for n in nums:
+                curSum += n
+                if curSum > largest:
+                    subarray += 1
+                    curSum = n
+            return subarray + 1 <= m
+        
+        l, r = max(nums), sum(nums)
+        res = r
+        while l <= r:
+            mid = l + ((r - l) // 2)
+            if canSplit(mid):
+                res = mid
+                r = mid - 1
+            else:
+                l = mid + 1
+        return res
