LeetCode:92.最小路径和

目录

1.最小路径和

---

1.最小路径和

        这道题与不同路径基本相同，只不过dp[i][j]取得是dp[i - 1][j]和dp[i][j - 1]中小的那一个值，再加上当前值

class Solution {
public:int minPathSum(vector<vector<int>>& grid) {int m = grid.size(), n = grid[0].size();vector<vector<int>> dp(m + 1, vector<int>(n + 1, INT_MAX));dp[1][0] = 0;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 - 1][j - 1];return dp[m][n];}
};