class Solution:

    def maxDistance(self, position: List[int], m: int) -> int:

        position.sort()

        lo, hi = 1, max(position)

        while lo + 1 < hi:

            mid, balls, prev = (lo + hi) >> 1, 1, position[0]

            for basket in position:

                if basket - prev >= mid:

                    balls, prev = balls + 1, basket

            if balls >= m:

                lo = mid

            else:

                hi = mid

        return lo

역시 어제처럼 또분탐색

이번에는 코드 알아보기 쉽게 써 봄