땅따먹기 - level2

programmers/땅따먹기.java

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