leetcode-第12周双周赛-5111-分享巧克力

class Solution:
    def maximizeSweetness(self, A: List[int], K: int) -> int:
        def possible(x):
            k, temp = 0, 0
            for a in A:
                temp += a
                if temp >= x:
                    k, temp = k + 1, 0
            return k >= K + 1

        l, h = min(A), sum(A)

while l < h:
            m = (l + h + 1) // 2
            print(l, h)
            if possible(m):
                l = m
            else:
                h = m - 1
        return l