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

import java.util.*;


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