Minimum Limit of Balls in a Bag LeetCode solution in Python

1
class Solution:
2
    def minimumSize(self, nums: List[int], maxOperations: int) -> int:
3
        l, r = 1, max(nums)
4
        while l < r:
5
            mid = (l + r) // 2
6
            if sum([(n - 1) // mid for n in nums]) > maxOperations:
7
                l = mid + 1
8
            else:
9
                r = mid
10
        return l