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

import java.util.*;
public class Main{
    public static void main(String[]args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt(),m = sc.nextInt();
        int[][] arr = new int[n+1][m+1];
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= m; j++){
                arr[i][j] = sc.nextInt();
            }
        }
        int[][] dp = new int[n+1][m+1];
        for(int i = 1; i <= n; i++){
            for(int j = 1; j<= m; j++){
                if(i == 1 && j == 1){
                    dp[i][j] = arr[i][j];
                    continue;
                }
                if(i == 1){
                    dp[i][j] = arr[i][j]+dp[i][j-1];
                    continue;
                }
                if(j == 1){
                    dp[i][j] = arr[i][j] + dp[i-1][j];
                     continue;
                }
                dp[i][j] = arr[i][j] + Math.min(dp[i-1][j],dp[i][j-1]);
               
            }
        }
        System.out.println(dp[n][m]);
    }
}