programmers_땅따먹기_java

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

프로그래머스

class Solution {
    int solution(int[][] land) {
        int answer = 0;

        int landWidth = 4;
        int landHeight = land.length;
        
        int[][] dp = new int[landHeight][landWidth];
        for(int i = 0; i<landHeight; i++){
            for(int j = 0; j<4; j++){
                if(i == 0){ // 첫번째 줄
                    dp[i][j] = land[i][j];
                }else{
                    int rowMax = 0;
                    for(int k = 0; k<4; k++){
                        if(k!=j){ // 같은 행 연속 밟지 않음 
                            rowMax = Math.max(rowMax, dp[i-1][k]);
                        }
                    }
                    dp[i][j] = land[i][j] + rowMax;
                }                
            }
        }
        
        for(int i = 0; i<4; i++){
            answer = Math.max(answer, dp[landHeight-1][i]);
        }

        return answer;
    }
    
    
}