2019 카카오 개발자 겨울 인턴십 - 징검다리 건너기 (Level 3)

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
def solution(stones, k):
    start = 0
    end   = max(stones)
    while start <= end:
        mid = int((start + end) / 2)
        count = 0
        for stone in stones:
            if count == k:
                break
            if stone <= mid:
                count += 1
            else:
                count = 0
        if count == k:
            end    = mid - 1
            result = mid
        else:
            start = mid + 1
    return result