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

import java.util.*;

// dp递推公式： dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + nums[i][j]; public class Main { public static void main(String[] args) { Scanner input = new Scanner(System.in); int n = input.nextInt(); int m = input.nextInt(); int[][] matrix = new int[n][m]; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) matrix[i][j] = input.nextInt();

    int[][] dp = new int[n][m];
    dp[0][0] = matrix[0][0];
    for (int i = 1; i < n; i++) {
        dp[i][0] = dp[i - 1][0] + matrix[i][0];
    }
    for (int j = 1; j < m; j++) {
        dp[0][j] = dp[0][j - 1] + matrix[0][j];
    }
    for (int i = 1; i < n; i++) {
        for (int j = 1; j < m; j++) {
            dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + matrix[i][j];
        }
    }
    System.out.println(dp[n - 1][m - 1]);
}

}