[Leetcode 64, Medium] Minimum Path Sum

最新推荐文章于 2026-06-20 22:09:08 发布

原创最新推荐文章于 2026-06-20 22:09:08 发布 · 369 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode #C++

收录于

Leetcode_medium 专栏收录该内容

99 篇文章

订阅专栏

本文介绍如何使用C++、Java、Python解决最小路径和问题，即在给定的m x n网格中，从左上角到右下角找到一条路径，使得所有经过的数字之和最小。分析了算法思路并提供了实现代码。

Problem:

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.

Analysis:

Solutions:

C++:

    int minPathSum(vector<vector<int>>& grid) {
        if(grid.empty())
            return 0;
        
        int rows = grid.size();
        for(int row = 1; row < rows; ++row) {
            grid[row][0] += grid[row - 1][0];
        }
        
        int cols = grid[0].size();
        for(int col = 1; col < cols; ++col) {
            grid[0][col] += grid[0][col - 1];
        }
        
        for(int row = 1; row < rows; ++row) {
            for(int col = 1; col < cols; ++col)
                grid[row][col] += min(grid[row - 1][col], grid[row][col - 1]);
        }
        
        return grid[rows - 1][cols - 1];
    }

Java:

Python: