leetcode#dp#931.下降路径最小和

首先，要列出状态转移方程

dp[i][j] = min{ dp[i-1][j-1],dp[i-1][j],dp[i-1][j+1] } + A[i][j]

代码如下:

class Solution {
    public int minFallingPathSum(int[][] A) {
        //dp[i][j] = min{dp[i-1][j-1],dp[i-1][j],dp[i-1][j+1]  } + a[i][j]
        int M = A.length,N = A[0].length;
        int[][]dp = new int[M][N];
        for(int i=0;i<N;++i) dp[0][i] = A[0][i];
         
        for(int i=1;i<M;++i) {
            for(int j=0;j<N;++j) {
                if(j==0) {
                    //列==0，没有 dp[i-1][j-1]
                    dp[i][j] = min( dp[i-1][j+1],dp[i-1][j] ) + A[i][j];
                }else if(j == N-1) {
                    //列最后，没有 dp[i-1][j+1]
                     dp[i][j] = min( dp[i-1][j-1],dp[i-1][j] ) + A[i][j];
                }else{
                    //都有，包括 dp[i-1][j]
                     dp[i][j] = min(dp[i-1][j-1] ,dp[i-1][j+1],dp[i-1][j] ) + A[i][j];
                }
                
            }
        }
        return min(dp[M-1]);


    }

    int min(int...a) {
        return Arrays.stream(a).min().getAsInt();
    }
}