64. 最小路径和

void1024

于 2024-07-13 22:02:52 发布

阅读量22

点赞数

分类专栏：面试经典 150 题文章标签：算法

本文链接：https://blog.csdn.net/diOSyu/article/details/140407436

版权

面试经典 150 题专栏收录该内容

100 篇文章 1 订阅

订阅专栏

class Solution {
    public int minPathSum(int[][] grid) {
        int m = grid.length, n = grid[0].length;
        int[][] mat = new int[m][n];
        mat[0][0] = grid[0][0];
        for (int i = 1; i < m; i++) {
            mat[i][0] = mat[i - 1][0] + grid[i][0];
        }
        for (int i = 1; i < n; i++) {
            mat[0][i] = mat[0][i - 1] + grid[0][i];
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                mat[i][j] = grid[i][j] + Math.min(mat[i][j - 1], mat[i - 1][j]);
            }
        }
        return mat[m - 1][n - 1];
    }
}