Programmers 땅따먹기

Answer

import java.util.Arrays;

class Solution {

    int solution(int[][] land) {
        int rows = land[0].length;
        int columns = land.length;
        
        for(int i = 1; i < columns; i++){
            for(int j = 0; j < rows; j++){
                int sum = 0;
                for(int k = 0; k < rows; k++){
                    if(j != k){
                        sum = Math.max(sum, land[i-1][k]);
                    }
                }
                land[i][j] += sum;
            }
        }

        Arrays.sort(land[columns-1]);
        return land[columns-1][rows-1];
    }
    
}