aboutsummaryrefslogtreecommitdiff
path: root/min_path_sum.c
diff options
context:
space:
mode:
Diffstat (limited to 'min_path_sum.c')
-rw-r--r--min_path_sum.c20
1 files changed, 20 insertions, 0 deletions
diff --git a/min_path_sum.c b/min_path_sum.c
new file mode 100644
index 0000000..f2cabbd
--- /dev/null
+++ b/min_path_sum.c
@@ -0,0 +1,20 @@
+// 64. Minimum Path Sum
+#include <math.h>
+
+// given 'm x n grid' filled with non-negative numbers, find a path from top
+// left to bottom right, which minimises the sum of all numbers along its path
+
+int minPathSum(int **grid, int grid_size, int *grid_col_size) {
+ int i, j;
+ for (i = 0; i < grid_size; i++) {
+ for (j = 0; j < (*grid_col_size); j++) {
+ if (i - 1 >= 0 && j - 1 >= 0)
+ grid[i][j] += fmin(grid[i - 1][j], grid[i][j - 1]);
+ else if (i - 1 >= 0)
+ grid[i][j] += grid[i - 1][j];
+ else if (j - 1 >= 0)
+ grid[i][j] += grid[i][j - 1];
+ }
+ }
+ return grid[i - 1][j - 1];
+}