[프로그래머스] 징검다리 건너기_이분탐색.py

def solution(stones, k):
    _min, _max = 0, max(stones)
    answer = 0
    while _min <= _max:
        mid = (_min + _max) // 2
        arr = []
        zero_in_row = 0 
        max_zeros = zero_in_row
        for i in range(len(stones)):
            if stones[i] >= mid:
                arr.append(stones[i])
            elif stones[i] < mid:
                arr.append(0)
            if arr[i] == 0:
                zero_in_row += 1
            elif arr[i] != 0:
                max_zeros = max(max_zeros, zero_in_row)
                zero_in_row = 0
        
        max_zeros = max(max_zeros, zero_in_row)
        if max_zeros >= k:
            _max = mid - 1
        else:
            answer = mid
            _min = mid + 1
    return answer