Maximum Candies Allocated to K Children LeetCode solution in Python

1
# Runtime: 3294 ms (Top 14.29%) | Memory: 27.4 MB (Top 62.05%)
2
def canSplit(candies, mid, k):
3
    split = 0
4
    for i in candies:
5
        split += i // mid
6
    if split >= k:
7
        return True
8
    else:
9
        return False
10

11

12
class Solution:
13
    def maximumCandies(self, candies: List[int], k: int) -> int:
14
        end = sum(candies) // k
15
        start = 1
16
        ans = 0
17
        while start <= end:
18
            mid = (start + end) // 2
19
            if canSplit(candies, mid, k):
20
                start = mid + 1
21
                ans = mid
22
            else:
23
                end = mid - 1
24
        return ans