[프로그래머스] 기능개발

stack_solution_01.js

function solution(progresses, speeds) {
    let answer = progresses.map((el, index) => Math.ceil((100 - el) / speeds[index]));
    
    const LENGTH = answer.length;
    let temp = [];
    let cnt = 1;
    let max = answer[0];
    
    for(let i = 1; i < LENGTH; i++){
        if(max >= answer[i]){
            cnt ++;
        } else if (max < answer[i]){
            temp.push(cnt);
            max = answer[i];
            cnt = 1;
        }
    }
    temp.push(cnt);
    
    return temp;
}