64. Minimum Path Sum

最新推荐文章于 2024-04-14 17:31:16 发布

原创最新推荐文章于 2024-04-14 17:31:16 发布 · 330 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种使用动态规划方法解决多维数组中从左上角到右下角最小路径和的问题。通过构建状态转移方程，逐步计算最优路径。重点展示了算法实现细节及效率提升策略。

摘要生成于 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.

int minPathSum(vector<vector<int>>& o) {
    int m = o.size();
    int n = o[0].size();
    vector<vector<int>> res=o;
    for (int i = 1; i < m; i++) res[i][0] += res[i - 1][0];
    for (int i = 1; i < n; i++) res[0][i] += res[0][i - 1];
    for (int i = 1; i < m; i++) {
        for (int j = 1; j < n; j++) {
            res[i][j] +=min(res[i - 1][j], res[i][j - 1]);
        }
    }
    return res[m - 1][n - 1];
}