Minimized Maximum of Products Distributed to Any Store LeetCode solution in Python

1
class Solution:
2
    def minimizedMaximum(self, n: int, quantities: List[int]) -> int:
3
        def cond(m, n):
4
            return sum([(q // m) + (q % m > 0) for q in quantities]) <= n
5

6
        l, r = 1, max(quantities)
7
        while l < r:
8
            m = (l + r) // 2
9
            if cond(m, n):
10
                r = m
11
            else:
12
                l = m + 1
13
        return l