(프로그래머스 KAKAO JS)징검다리 건너기

https://programmers.co.kr/learn/courses/30/lessons/64062?language=javascript 

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

 

const binarySearch = (stones, mid, k) => {
    let count = 0;
    
    for(let i = 0; i < stones.length; i++){
        if(stones[i] - mid <= 0){
            count++;
        } else{
            count = 0;
        }
        
        if(count >= k){
            return true;
        }
    }
    
    return false;
}

const solution = (stones, k) => {
    let front = 0;
    let back = 200000000;
    
    while(front <= back){
        const mid = Math.floor((front + back) / 2);
        
        if(binarySearch(stones, mid, k)){
            back = mid - 1;
        } else{
            front = mid + 1;
        }
    }
    
    return front;
}