[프로그래머스] 징검다리(Python)

 

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

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

def solution(distance, rocks, n):
        result =0
        rocks.extend([0,distance]) # 0 distance 추가
        rocks.sort() # 정렬
        start, end = 0, distance

        while start<=end: # 이분탐색
            mid = (start+end)//2 
            temp=rocks[0]
            cnt=0
            for i in rocks:
                if i-temp>=mid:
                    temp=i
                else:
                    cnt+=1

            if cnt>n+1:
                end=mid-1
            else:
                start = mid+1
                if mid>result:                    
                    result=mid
                    
        return result