链接: 最小路径和

题目描述

算法流程

编程代码

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] = 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];
    }
};