[프로그래머스 Level 2] 땅따먹기

function solution(land) {
    const m = land.length;  // N행
    const n = 4;            // 4열
    const table = Array.from({ length: m }, () => new Array(n));
 
    table[0] = land[0];
 
    for(let i = 1; i < m; i++){
        for(let j = 0; j < n; j++){
            table[i][j] = Math.max(...(table[i-1].filter((_, index) => index !== j))) + land[i][j];
        }
    }
 
    return Math.max(...table[m-1]);
}