题解 | 矩阵的最小路径和

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param matrix int整型二维数组 the matrix
     * @return int整型
     */
    public int minPathSum (int[][] matrix) {
        int[][] dp = new int[matrix.length][matrix[0].length];
        for (int i = 0; i < dp.length; i++) {
            for (int j = 0; j < dp[0].length; j++) {
                if (i != 0 && j != 0) {
                    dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + matrix[i][j];
                } else {
                    if (i != 0) {
                        dp[i][j] = dp[i - 1][j] + matrix[i][j];
                    } else if (j != 0) {
                        dp[i][j] = dp[i][j - 1] + matrix[i][j];
                    } else {
                        dp[i][j] = matrix[i][j];;
                    }
                }
            }
        }
        return dp[matrix.length - 1][matrix[0].length - 1];
    }
}