题解 | 矩阵的最小路径和

import java.util.*;


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