[Algorithm] 47 week(12.19 ~ 12.25) 1/3

기능개발

function solution(progresses, speeds) {
    let result = [];
    let convertProgresses = progresses.map((progress, i) => Math.ceil((100 - progress) / speeds[i]));
    let count = 1;
    let idx = 0;
    for(let i = 1; i < convertProgresses.length; i++){
        if(convertProgresses[idx] >= convertProgresses[i]){
            count++;
        } else{
            result.push(count);
            idx += count
            count = 1;
        }

        if( i == convertProgresses.length-1){
            result.push(count)
        }
    }

    return result;
}