【力扣 中等 C】64. 最小路径和

目录

题目

解法一：动态规划

---

题目

待添加

解法一：动态规划

int min(int a, int b) {return a < b ? a : b;
}int minPathSum(int** grid, int gridSize, int* gridColSize) {const int m = gridSize, n = *gridColSize;int dp[m][n];dp[0][0] = grid[0][0];for (int i = 1; i < m; i++) {dp[i][0] = dp[i - 1][0] + grid[i][0];}for (int i = 1; i < n; i++) {dp[0][i] = dp[0][i - 1] + grid[0][i];}for (int i = 1; i < m; i++) {for (int j = 1; j < n; j++) {dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];}}return dp[m - 1][n - 1];
}