[코딜리티] NumberSolitaire

나의 풀이

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
     
    for (let i = 1; i < A.length ; i++) {
        let max = -Infinity;    
        for (let j = 1; j <= 6; j++) {
            if (i - j >= 0) {
                const sum = A[i] + A[i-j];
                max = max < sum ? sum : max;
            }
        }
        A[i] = max;
    }
    return A[A.length-1];
}

결과