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

java版易理解dp

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