最小路径和

题源：LeetCode

链接：https://leetcode-cn.com/problems/minimum-path-sum/

 

 

 

还是一道经典的动态规划题

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int glength = grid[0].size();
        int width = grid.size();
        vector<vector<int>> dp(width,vector<int>(glength));
        dp[0][0] = grid[0][0];

        for(int i = 1;i<glength;i++){
            dp[0][i] = dp[0][i-1]+grid[0][i];
        }

        for(int j = 1;j<width;j++){
            dp[j][0] = dp[j-1][0]+grid[j][0];
        }

        for(int i = 1;i<max(glength,width);i++){
            for(int j = 1;j<=i;j++){
                dp[i][j] = min(dp[i-1][j],dp[i][j-1])+grid[i][j];
            }
        }

        return dp[width-1][glength-1];

    }
};

 

另外昨天接触到了滚动数组思想，今天来学习一下。

https://blog.csdn.net/weixin_40295575/article/details/80181756