[Day 9]アルゴリズム

スタック/キュー

質問です。

function solution(progresses, speeds) {
    let result =[];
    
    while(speeds.length > 0) {
        for(let i=0; i< speeds.length; i++) {            
            if(progresses[i] < 100) {
                progresses[i] += speeds[i];
            }
        }
        let count = 0;
        while(progresses[0] >= 100) {
            progresses.shift();
            speeds.shift();
            count++
        }
        
        if(count > 0)  {
            result.push(count);
        }
    }
    
    return result;
}

質問です。

function solution(bridge_length, weight, truck_weights) {
    let result = [];
    let bridgeArr = [];
    
    for(let i=0; i< truck_weights.length; i++) {
        bridgeArr.push(truck_weights[i]);
        if(truck_weights[i] + truck_weights[i+1] > weight) {
            truck_weights.shift();
            let runtime = bridge_length;
            let count = 0;
            while(bridgeArr.length <= 0) {
                if(runtime > 0){
                 runtime -= 1;
                 count++   
                }else {
                  bridgeArr.shift();
                }
            }
            result.push(count);
        }
        
        // 두친구가 같이 탔을경우
        if(truck_weights[i] + truck_weights[i+1] < weight) { 
            
        }
    }
}


// 다리 길이 - 1초 * 2