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

 

 

[문제]

https://school.programmers.co.kr/learn/courses/30/lessons/12913#qna

프로그래머스

 

 

[소스 코드]

class Solution {
    int solution(int[][] land) {
        int answer = 0;
        int n = land.length;
        for(int i=1;i<n;i++){
            for(int j=0;j<4;j++){
                int max = 0;
                for(int k=0;k<4;k++){
                    if(j==k) continue;
                    max = Math.max(max,land[i-1][k]);
                }
                land[i][j] += max;
            }
        }
        for(int i=0;i<4;i++){
            answer = Math.max(answer,land[n-1][i]);
        }
        return answer;
    }
}