LeetCode-Minimum Path Sum

最新推荐文章于 2024-10-10 04:34:22 发布

原创最新推荐文章于 2024-10-10 04:34:22 发布 · 297 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #Minimum Path Sum

Cracking LeetCode 同时被 2 个专栏收录

152 篇文章

订阅专栏

Math Game

50 篇文章

订阅专栏

本文介绍了一个经典算法问题——寻找二维网格中从左上角到右下角的最小路径和，仅允许向右或向下移动。通过动态规划的方法，详细展示了如何计算每个网格单元格的最小路径和，最终得出解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Solution:

Code:

<span style="font-size:14px;">class Solution {
public:
    int minPathSum(vector<vector<int> > &grid) {
        const int m = grid.size();
        if (m == 0) return 0;
        const int n = grid[0].size();
        for (int i = 1; i < m; ++i)
            grid[i][0] += grid[i-1][0];
        for (int j = 1; j < n; ++j)
            grid[0][j] += grid[0][j-1];
        for (int i = 1; i < m; ++i)
            for (int j = 1; j < n; ++j)
                grid[i][j] += min(grid[i-1][j], grid[i][j-1]);
        return grid[m-1][n-1];
    } 
};</span>