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

def solution(distance, rocks, n):
    rocks=[0]+sorted(rocks)+[distance]
    rocks=[rocks[i+1]-rocks[i] for i in range(len(rocks)-1)]
    
    start=0
    end=distance
    
    while start<=end:
        middle=(start+end)//2
        cnt=0
        new_rocks=rocks[::]
        for idx in range(len(new_rocks)-1):
            if new_rocks[idx]<middle:
                new_rocks[idx+1]+=new_rocks[idx]
                cnt+=1
        else:
            if new_rocks[-1]<middle:
                cnt+=1
        
        if cnt>n:
            end=middle-1
        else:
            start=middle+1
    
    return end