题解 | #矩阵的最小路径和#
矩阵的最小路径和
https://www.nowcoder.com/practice/38ae72379d42471db1c537914b06d48e
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int m=sc.nextInt();
int[][] ints=new int[n][m];
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
ints[i][j]=sc.nextInt();
}
}
int[][] dp=new int[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if(i==0&&j==0){
dp[i][j]=ints[i][j];
}
if(i==0&&j!=0){
dp[i][j]=ints[i][j]+dp[i][j-1];
}
if(i!=0&&j==0){
dp[i][j]=ints[i][j]+dp[i-1][j];
}
if(i!=0&&j!=0){
dp[i][j]=Math.min(ints[i][j]+dp[i-1][j],ints[i][j]+dp[i][j-1]);
}
}
}
System.out.println(dp[n-1][m-1]);
}
}
