public class DynamicPlan {
public static int getMinDis(int[][] matrix, int n) {
int[][] state = new int[n][n];
// 初始化,横向
int sum = 0;
for (int i = 0; i < n; i++) {
state[0][i] = sum + matrix[0][i];
}
// 初始化纵向
sum = 0;
for (int j = 0; j < n; j++) {
state[j][0] = sum + matrix[j][0];
}
// 开始从上到下开始规划
for (int i = 1; i < n; i++) {
for (int j = 1; j < n; j++) {
state[i][j] = matrix[i][j] + Math.min(state[i - 1][j], state[i][j - 1]);
}
}
return state[n - 1][n - 1];
}
}