lintcode minimum-path-sum 最小路径和

最新推荐文章于 2020-10-31 00:29:32 发布

stevewongbuaa

最新推荐文章于 2020-10-31 00:29:32 发布

阅读量370

点赞数

分类专栏：动态规划 lintcode 文章标签： lintcode 动态规划

本文链接：https://blog.csdn.net/waltonhuang/article/details/52036419

版权

lintcode 同时被 2 个专栏收录

49 篇文章 0 订阅

订阅专栏

动态规划

19 篇文章 0 订阅

订阅专栏

问题描述

lintcode

笔记

设置buff[i][j]为到达(i,j)的最小路径和。
初始化：

buff[0][0] = grid[0][0];
for (int i = 1; i < m; i++)
    buff[i][0] = buff[i-1][0] + grid[i][0];
for (int j = 1; j < n; j++)
    buff[0][j] = buff[0][j-1] + grid[0][j];

状态转移方程：

buff[i][j] = min(buff[i-1][j], buff[i][j-1]) + grid[i][j];

代码

class Solution {
public:
    /**
     * @param grid: a list of lists of integers.
     * @return: An integer, minimizes the sum of all numbers along its path
     */
    int minPathSum(vector<vector<int> > &grid) {
        // write your code here
        const int m = grid.size();
        const int n = grid[0].size();
        vector<vector<int>> buff(m, vector<int>(n,0));
        buff[0][0] = grid[0][0];
        for (int i = 1; i < m; i++)
            buff[i][0] = buff[i-1][0] + grid[i][0];
        for (int j = 1; j < n; j++)
            buff[0][j] = buff[0][j-1] + grid[0][j];
        for (int i = 1; i < m; i++)
        {
            for (int j = 1; j < n; j++)
            {
                buff[i][j] = min(buff[i-1][j], buff[i][j-1]) + grid[i][j]; 
            }
        }
        return buff[m-1][n-1];
    }
};