Minimum path sum

Signed-off-by: begeekmyfriend <[email protected]>

064_minumum_path_sum/Makefile

@@ -0,0 +1,2 @@
+all:
+	gcc -O2 -o test minimum_path_sum.c

064_minumum_path_sum/minimum_path_sum.c

@@ -0,0 +1,53 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <limits.h>
+
+int minPathSum(int** grid, int gridRowSize, int gridColSize) {
+    int i, j;
+    int **dp = malloc(gridRowSize * sizeof(int *));
+    for (i = 0; i < gridRowSize; i++) {
+        dp[i] = malloc(gridColSize * sizeof(int));
+    }
+
+    dp[0][0] = grid[0][0];
+    int sum = dp[0][0];
+    for (i = 1; i < gridRowSize; i++) {
+        sum += grid[i][0];
+        dp[i][0] = sum;
+    }
+
+    sum = dp[0][0];
+    for (i = 1; i < gridColSize; i++) {
+        sum += grid[0][i];
+        dp[0][i] = sum;
+    }
+
+    int min = INT_MAX;
+    for (i = 1; i < gridRowSize; i++) {
+        for (j = 1; j < gridColSize; j++) {
+            int n = dp[i - 1][j] < dp[i][j - 1] ? dp[i - 1][j] : dp[i][j - 1];
+            dp[i][j] = n + grid[i][j];
+        }
+    }
+
+    return dp[gridRowSize - 1][gridColSize - 1];
+}
+
+int main(int argc, char **argv)
+{
+    int i, j;
+    int row = argc - 1;
+    int col = strlen(argv[1]);
+    int **grid = malloc(row * sizeof(int *));
+    for (i = 0; i < row; i++) {
+        grid[i] = malloc(col * sizeof(int));
+        for (j = 0; j < col; j++) {
+            grid[i][j] = argv[i + 1][j] - '0';
+            printf("%d ", grid[i][j]);
+        }
+        printf("\n");
+    }
+    printf("%d\n", minPathSum(grid, row, col));
+    return 0;
+}