Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 64. Minimum Path Sum

---

參考資訊：
https://www.cnblogs.com/grandyang/p/4353255.html

題目：


解答：

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int m = grid.size();
        int n = grid[0].size();
        vector<vector<int>> dp(m + 1, vector<int>(n + 1, INT_MAX));

        dp[0][1] = 0;
        dp[1][0] = 0;
        for (int i = 1; i <= m; ++i) {
            for (int j = 1; j <= n; ++j) {
                dp[i][j] = grid[i - 1][j - 1] + min(dp[i - 1][j], dp[i][j - 1]);
            }
        }

        return dp[m][n];
    }
};