[Programmers] Lv 2. 디펜스 게임

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

프로그래머스

 

function solution(n, k, enemy) {
    var answer = 0;
    const [arr, invincibility] = [enemy.reduce((acc, e) => ((acc[e] = ++acc[e] || 1), acc), []), {}];

    for (let i = arr.length - 1, tempK = k; i >= 0 && tempK; --i) {
        if (!arr[i]) continue;

        if (tempK <= arr[i]) (invincibility[i] = tempK), (tempK = 0);
        else (invincibility[i] = arr[i]), (tempK -= arr[i]);
    }

    for (e of enemy) {
        if (invincibility[e] && k) {
            --k, --invincibility[e], ++answer;
            continue;
        }

        if (n < e && k) --k, ++answer;
        else if (n >= e) (n -= e), ++answer;
        else break;
    }

    return answer;
}

GitHub :