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

import java.util.*;


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