题解 | 矩阵的最小路径和

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param matrix int整型二维数组 the matrix
     * @return int整型
     */
    public int minPathSum (int[][] matrix) {
        // write code here
        if (matrix == null || matrix.length == 0) return 0;
        int[][] dip = new int[matrix.length][matrix[0].length];

        for (int i = 0; i < matrix.length; i++) {
            for (int j = 0; j < matrix[0].length; j++) {

                if (i == 0 && j == 0) {
                    dip[i][j] = matrix[i][j];
                } else if (i == 0) {
                    dip[i][j] = matrix[i][j] + dip[i][j - 1];
                } else if (j == 0) {
                    dip[i][j] = matrix[i][j] + dip[i - 1][j];
                } else {
                    dip[i][j] = matrix[i][j] + Math.min(dip[i - 1][j], dip[i][j - 1]);
                }
            }
        }

        return dip[matrix.length - 1][matrix[0].length - 1];
    }
}