Week 3 - 2 - 더 맵게

[Im-amberIm]

문제 링크:

https://school.programmers.co.kr/learn/courses/30/lessons/42626

[mjpark-k]

function solution(scoville, K) {
    let mixScoville = 0;
    let mixedCount = 0;
    
    scoville.sort((a, b) => a - b);
    
    while (scoville[0] < K) {
        if (scoville.length === 1 && scoville[0] < K) return -1;
        
        mixScoville = scoville.shift() + (scoville.shift() * 2);
        scoville.push(mixScoville);
        scoville.sort((a, b) => a - b);
        mixedCount++;
    }
    
    return mixedCount;
}

아직 AI없이는 정답을 못찾겠습니다.