Py) 프로그래머스 43236 징검다리

**다시풀기

https://programmers.co.kr/learn/courses/30/lessons/43236

코딩테스트 연습 - 징검다리

 

def solution(distance, rocks, n):
    rocks.sort()
    rocks.append(distance)
    left, right = 1, distance

    while left <= right:
        mid = (left + right) // 2
        current = 0
        removed_rocks = 0

        for rock in rocks:
            if rock - current < mid:
                removed_rocks += 1
            else:
                current = rock
        if removed_rocks > n:
            right = mid - 1
        else:
            answer = mid
            left = mid + 1

    return answer