LeetCode——Minimum Path Sum

最新推荐文章于 2025-09-11 19:19:55 发布

pickless

最新推荐文章于 2025-09-11 19:19:55 发布

阅读量574

点赞数

CC 4.0 BY-SA版权

分类专栏： Online Judge 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/pickless/article/details/9949647

Online Judge 专栏收录该内容

134 篇文章

订阅专栏

本文介绍了一个经典算法问题——寻找二维网格中从左上角到右下角的最小路径和。该路径只能向右或向下移动。通过动态规划的方法解决此问题，并详细展示了算法实现的代码。

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.

Note: You can only move either down or right at any point in time.

» Solve this problem

思路与Unique Path一致。

class Solution {
public:
    int minPathSum(vector<vector<int> > &grid) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (grid.empty() || grid[0].empty()) {
            return 0;
        }
        
        int m = grid.size(), n = grid[0].size();
        int f[m][n];
        memset(f, 0, sizeof(int) * m * n);
        
        f[0][0] = grid[0][0];
        for (int i = 1; i < m; i++) {
            f[i][0] = f[i - 1][0] + grid[i][0];            
        }
        for (int i = 1; i < n; i++) {
            f[0][i] = f[0][i - 1] + grid[0][i];
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                f[i][j] = (f[i - 1][j] < f[i][j - 1] ? f[i - 1][j] : f[i][j - 1]) + grid[i][j];
            }
        }
        return f[m - 1][n - 1];
    }
};