기능개발(프로그래머스, JavaScript)

//다른이의 풀이
function solution(progresses, speeds) {
    let answer = [0];
    let days = progresses.map((progress, index) => Math.ceil((100 - progress) / speeds[index]));
    let maxDay = days[0];
 
    for(let i = 0, j = 0; i< days.length; i++){
        if(days[i] <= maxDay) {
            answer[j] += 1;
        } else {
            maxDay = days[i];
            answer[++j] = 1;
        }
    }
 
    return answer;
}
 
 
//나의풀이
function solution(progresses, speeds) {
    let answer = [];
    let count=0;
 while(progresses.length>0){
 
    let t = Math.ceil((100-progresses[0])/speeds[0]); 
    progresses=progresses.map((x,index)=>x+speeds[index]*t);
 
 
    for(let i=0;i<progresses.length;i++){
        if(progresses[i]>=100){
            count++;
        }else break;
    }
    answer.push(count);
 
    for(let i=0;i<count;i++){
        progresses.shift();
        speeds.shift();
    }
    count=0;
}
return answer;
}