Find the Smallest Divisor Given a Threshold LeetCode solution in Python

1
class Solution:
2
    def helper(self, nums, m):
3
        Sum = 0
4
        for n in nums:
5
            Sum += math.ceil(n / m)
6
        return Sum
7

8
    def smallestDivisor(self, nums: List[int], threshold: int) -> int:
9
        l, r = 1, max(nums)
10
        while l < r:
11
            mid = (l + r) // 2
12
            Sum = self.helper(nums, mid)
13
            if Sum > threshold:
14
                l = mid + 1
15
            else:
16
                r = mid
17
        return r