jmug/CS153
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Update hw4 to a newer version.

Browse source 
Signed-off-by: jmug <u.g.a.mariano@gmail.com>
This commit is contained in:
Mariano Uvalle 2025-01-24 21:01:32 -08:00
parent 07d34c0cd8
commit b24a264f7e
221 changed files with 846 additions and 746 deletions
Download patch file Download diff file Expand all files Collapse all files

47
hw4/hw4programs/shortest_path_matrix.oat Normal file
View file

@ -0,0 +1,47 @@
int shortest_path(int[][] matrix, int w, int h) {
var dp = new int[][h];
for (var i = 0; i < h; i=i+1;) {
dp[i] = new int[w];
for (var j = 0; j < w; j=j+1;) {
dp[i][j] = 0;
}
}
return shortest_path_dp(matrix, dp, 0, 0, w, h);
}
int shortest_path_dp(int[][] matrix, int[][] dp, int i, int j, int w, int h) {
if (i >= w | j >= h) {
return 100;
}
if (i == w-1 & j == h-1) {
dp[i][j] = matrix[i][j];
return dp[i][j];
}
if (dp[i][j] != 0) {
return dp[i][j];
}
var go_down_val = shortest_path_dp(matrix, dp, i, j+1, w, h);
var go_right_val = shortest_path_dp(matrix, dp, i+1, j, w, h);
if (go_down_val < go_right_val) {
dp[i][j] = go_down_val + matrix[i][j];
} else {
dp[i][j] = go_right_val + matrix[i][j];
}
return dp[i][j];
}
int program(int argc, string[] argv) {
var matrix = new int[][5];
for (var i = 0; i < 5; i=i+1;) {
matrix[i] = new int[5];
}
for (var i = 0; i < 5; i=i+1;) {
for (var j = 0; j < 5; j=j+1;) {
matrix[i][j] = 2*(i+1) + (j+1);
}
}
matrix[0][4] = 50;
matrix[1][3] = 50;
matrix[2][2] = 50;
return shortest_path(matrix, 5, 5);
}