推 oin1104: 大師 06/20 22:35
推 Furina: 大師 06/20 22:39
推 smart0eddie: 大師 06/20 22:42
幸好有昨天那題
今天有想到
def maxDistance(self, position: List[int], m: int) -> int:
position.sort()
def f(interval):
prev, cnt = -2**31, 0
for p in position:
if p-prev >= interval:
cnt += 1
prev = p
if cnt >= m:
return True
return False
l, r = 1, (max(position)-min(position))//(m-1)+1
while l<r:
mid = (l+r)//2
if f(mid):
l = mid+1
else:
r = mid
return l-1
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 42.79.54.128 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1718894115.A.A95.html