LeetCode Minimum Path Sum

最新推荐文章于 2024-04-22 14:00:57 发布

aay.zhang

最新推荐文章于 2024-04-22 14:00:57 发布

阅读量436

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/aay_dps/article/details/8201369

leetcode 专栏收录该内容

82 篇文章

订阅专栏

本文提供了一个C++实现的算法解决方案，用于寻找二维网格中从左上角到右下角的路径，该路径上的数字之和最小。网格中的数字非负，且只能向下或向右移动。

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

Minimum Path Sum

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:

class Solution {
public:
    int minPathSum(vector<vector<int> > &grid) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<vector<int> > sums;
        sums.resize(grid.size());
        for(int i=0;i<sums.size();++i){
            sums[i].resize(grid[0].size());
        }
        sums[0][0]=grid[0][0];
        for(int i=1;i<grid.size();++i){
            sums[i][0]=sums[i-1][0]+grid[i][0];
        }
        for(int i=1;i<grid[0].size();++i){
            sums[0][i]=sums[0][i-1]+grid[0][i];
        }
        for(int i=1;i<grid.size();++i){
            for(int j=1;j<grid[i].size();++j){
                sums[i][j]=min(sums[i-1][j],sums[i][j-1])+grid[i][j];
            }
        }
        return sums.back().back();
    }
};