_1289.java

packagecom.fishercoder.solutions.secondthousand;

publicclass_1289 {
publicstaticclassSolution1 {
publicintminFallingPathSum(int[][] arr) {
intsize = arr.length;
int[][] dp = newint[size][size];
for (inti = 0; i < size; i++) {
for (intj = 0; j < size; j++) {
if (i == 0) {
dp[i][j] = arr[i][j];
 } else {
intpreviousRowMin = Integer.MAX_VALUE;
for (intk = 0; k < size; k++) {
if (k != j) {
previousRowMin = Math.min(dp[i - 1][k], previousRowMin);
 }
 }
dp[i][j] = arr[i][j] + previousRowMin;
 }
 }
 }
intresult = dp[size - 1][size - 1];
for (inti = 0; i < size; i++) {
result = Math.min(result, dp[size - 1][i]);
 }
returnresult;
 }
 }
}