기능개발

기능 개발

2020.07.29

const solution = (progresses, speeds) =>{
    const result = [];
    while(progresses.length){
        let count = 0;
        while(progresses[0]>=100){
            progresses.shift();
            speeds.shift()
            count++;
        }
        if(count>0){
            result.push(count);
        }
        progresses=progresses.map((process, idx)=>{
            return process + speeds[idx]
        })
    }
    return result;
}

• 큐로 푸는 문제