class Solution:
def minimumSize(self, nums: List[int], maxOperations: int) -> int:
def operate(x):
sum = 0
for i in range(len(nums)):
if nums[i]>x:
if nums[i]%x==0:
sum += nums[i]//x -1
else:
sum += nums[i]//x
return sum
l = 1
r = max(nums)
while l<r:
mid = (l+r)//2
if operate(mid)<=maxOperations:
r=mid
else:
l = mid+1
return r
袋子里最少数目的球(中等题)
于 2022-05-20 10:00:41 首次发布