class Solution:
def maxDistance(self, position: List[int], m: int) -> int:
# 二分
def check(x):
pre = position[0]
cnt = 1
for i in range(1, len(position)):
if position[i] - pre >= x:
cnt = cnt + 1
pre = position[i]
return cnt < m
position.sort()
left = 1
right = position[-1] - position[0]
while left < right:
mid = (left + right + 1) // 2
if check(mid):
right = mid - 1
else:
left = mid
return left
1552. 两球之间的磁力
最新推荐文章于 2024-04-23 17:09:00 发布