题解 | #矩阵的最小路径和#

public class Solution {
    /**
     * 
     * @param matrix int整型二维数组 the matrix
     * @return int整型
     */
    public int minPathSum (int[][] matrix) {
        // write code here
        if(matrix == null ){
            return 0;
        }
        int row = matrix.length;
        int col = matrix[0].length;
        int[][] dp = new int[row][col];
       
       dp[0][0] = matrix[0][0];
        for(int i =1;i<row;i++){
            dp[i][0] = dp[i-1][0] + matrix[i][0];
        }
        for(int j =1;j<col;j++){
            dp[0][j] = dp[0][j-1] + matrix[0][j];
        }

        for(int i= 1; i< row;i++){
            for(int j = 1;j<col;j++){
                
                dp[i][j] = Math.min(dp[i-1][j],dp[i][j-1]) + matrix[i][j];
            }
        }
        return dp[row-1][col-1];
        
    }
}